Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Antichains in the cycle continuous order
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Infinite Graphs
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Infinite Graphs
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Infinite Graphs
mdevos
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Algorithms
mdevos
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Coloring random subgraphs
Bukh
✭✭
0
Probabilistic G.T.
mdevos
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Directed Graphs
fhavet
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Directed Graphs
JS
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
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
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Total Colouring Conjecture
Behzad
✭✭✭
0
Coloring
Iradmusa
Barnette's Conjecture
Barnette
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Probabilistic G.T.
DOT
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Basic G.T.
»
Cycles
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Directed Graphs
»
Tournaments
fhavet
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Directed Graphs
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