Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Random stable roommates
Mertens
✭✭
0
Basic G.T.
»
Matchings
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
Barnette's Conjecture
Barnette
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Chords of longest cycles
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
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
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Basic G.T.
»
Cycles
fhavet
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Basic G.T.
»
Cycles
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Basic G.T.
»
Cycles
fhavet
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
Kriesell's Conjecture
Kriesell
✭✭
0
Basic G.T.
»
Connectivity
Jon Noel
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Basic G.T.
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Basic G.T.
mdevos
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Basic G.T.
andreasruedinger
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Basic G.T.
fhavet
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
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
Triangle free strongly regular graphs
✭✭✭
0
Algebraic G.T.
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
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
« 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