Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Topological G.T.
fhavet
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Directed Graphs
fhavet
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
Kriesell's Conjecture
Kriesell
✭✭
0
Basic G.T.
»
Connectivity
Jon Noel
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Infinite Graphs
Robert Samal
Imbalance conjecture
Kozerenko
✭✭
0
Sergiy Kozerenko
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Directed Graphs
fhavet
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Infinite Graphs
mdevos
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Algebraic G.T.
mdevos
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Basic G.T.
»
Cycles
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Directed Graphs
fhavet
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Basic G.T.
mdevos
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Goldberg's conjecture
Goldberg
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Hypergraphs
tchow
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
jcmeyer
Faithful cycle covers
Seymour
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Exact colorings of graphs
Erickson
✭✭
0
Martin Erickson
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Basic G.T.
»
Cycles
fhavet
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Topological G.T.
fhavet
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Directed Graphs
fhavet
End-Devouring Rays
Georgakopoulos
✭
1
Infinite Graphs
Agelos
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
tchow
Earth-Moon Problem
Ringel
✭✭
1
Coloring
»
Vertex coloring
fhavet
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Coloring
»
Vertex coloring
DFR
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Topological G.T.
mdevos
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
« 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