Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
Goldberg's conjecture
Goldberg
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Basic G.T.
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Directed Graphs
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Basic G.T.
»
Cycles
fhavet
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
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Algebraic G.T.
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Infinite Graphs
mdevos
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Directed Graphs
fhavet
Imbalance conjecture
Kozerenko
✭✭
0
Sergiy Kozerenko
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Infinite Graphs
Robert Samal
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Kriesell's Conjecture
Kriesell
✭✭
0
Basic G.T.
»
Connectivity
Jon Noel
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Directed Graphs
fhavet
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Topological G.T.
fhavet
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Topological G.T.
»
Drawings
taxipom
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Coloring
»
Vertex coloring
fhavet
List colorings of edge-critical graphs
Mohar
✭✭
0
Coloring
»
Edge coloring
Robert Samal
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Coloring
»
Vertex coloring
David Wood
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
Lovász Path Removal Conjecture
Lovasz
✭✭
0
fhavet
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
Matching cut and girth
✭✭
0
w
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Basic G.T.
»
Matchings
Jirka
Melnikov's valency-variety problem
Melnikov
✭
0
Coloring
»
Vertex coloring
asp
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
fhavet
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
fhavet
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
»
Tournaments
mdevos
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
Jon Noel
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Probabilistic 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