Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Topological G.T.
»
Crossing numbers
cibulka
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
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
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Directed Graphs
fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Extremal G.T.
asp
Are almost all graphs determined by their spectrum?
✭✭✭
0
mdevos
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
fhavet
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
Jon Noel
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Basic G.T.
»
Cycles
mdevos
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
« first
‹ previous
1
2
3
4
5
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