Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Matching cut and girth
✭✭
0
w
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Hypergraphs
tchow
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
tchow
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Topological G.T.
»
Drawings
taxipom
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Imbalance conjecture
Kozerenko
✭✭
0
Sergiy Kozerenko
Circular choosability of planar graphs
Mohar
✭
0
Coloring
»
Homomorphisms
rosskang
Cores of Cayley graphs
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
The Crossing Number of the Complete Graph
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Crossing Number of the Complete Bipartite Graph
Turan
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Barnette's Conjecture
Barnette
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
List colorings of edge-critical graphs
Mohar
✭✭
0
Coloring
»
Edge coloring
Robert Samal
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
Weak pentagon problem
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Oriented chromatic number of planar graphs
✭✭
0
Coloring
»
Vertex coloring
Robert Samal
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
The three 4-flows conjecture
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Unit vector flows
Jain
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Basic G.T.
»
Cycles
mdevos
The circular embedding conjecture
Haggard
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Faithful cycle covers
Seymour
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
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