Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Algebraic G.T.
mdevos
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Algebraic G.T.
mdevos
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
mdevos
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Basic G.T.
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Hypergraphs
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
The Two Color Conjecture
Neumann-Lara
✭✭
0
Directed Graphs
mdevos
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Coloring
»
Vertex coloring
berger
Consecutive non-orientable embedding obstructions
✭✭✭
0
Topological G.T.
»
Genus
Bruce Richter
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Woodall's Conjecture
Woodall
✭✭✭
0
Directed Graphs
mdevos
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Coloring
»
Edge coloring
mdevos
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
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Antichains in the cycle continuous order
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Universal point sets for planar graphs
Mohar
✭✭✭
0
Topological G.T.
»
Drawings
mdevos
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Infinite Graphs
mdevos
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Triangle free strongly regular graphs
✭✭✭
0
Algebraic G.T.
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Infinite Graphs
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
Barnette's Conjecture
Barnette
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
List colorings of edge-critical graphs
Mohar
✭✭
0
Coloring
»
Edge coloring
Robert Samal
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Coloring
»
Vertex coloring
mdevos
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
Weak pentagon problem
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Graceful Tree Conjecture
✭✭✭
0
Coloring
»
Labeling
kintali
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
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Basic G.T.
»
Matchings
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Hypergraphs
Dino
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Coloring
Gordon Royle
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Extremal G.T.
boris
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Topological G.T.
»
Drawings
taxipom
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Directed Graphs
JS
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Coloring
»
Edge coloring
macajova
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
« 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