Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Goldberg's conjecture
Goldberg
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Coloring
»
Vertex coloring
DFR
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Coloring
»
Vertex coloring
Andrew King
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Topological G.T.
mdevos
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Basic G.T.
andreasruedinger
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Algorithms
mdevos
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Topological G.T.
»
Crossing numbers
cibulka
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Odd cycles and low oddness
✭✭
0
Gagik
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
jcmeyer
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
jcmeyer
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
jcmeyer
Exact colorings of graphs
Erickson
✭✭
0
Martin Erickson
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Coloring
»
Homomorphisms
jfoniok
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Matching cut and girth
✭✭
0
w
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Circular choosability of planar graphs
Mohar
✭
0
Coloring
»
Homomorphisms
rosskang
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Probabilistic G.T.
DOT
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Directed Graphs
»
Tournaments
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Coloring
»
Edge coloring
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Directed Graphs
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
fhavet
Melnikov's valency-variety problem
Melnikov
✭
0
Coloring
»
Vertex coloring
asp
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Basic G.T.
»
Cycles
fhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Basic G.T.
»
Cycles
fhavet
« first
‹ previous
1
2
3
4
5
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Algebraic G.T.
(8)
Basic G.T.
(39)
Coloring
(65)
Directed Graphs
(26)
Extremal G.T.
(9)
Graph Algorithms
(3)
Hypergraphs
(5)
Infinite Graphs
(11)
Probabilistic G.T.
(3)
Topological G.T.
(18)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more