Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Topological G.T.
»
Coloring
David Wood
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Coloring
»
Vertex coloring
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
David Wood
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Topological G.T.
»
Crossing numbers
cibulka
Consecutive non-orientable embedding obstructions
✭✭✭
0
Topological G.T.
»
Genus
Bruce Richter
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Extremal G.T.
boris
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Coloring
»
Vertex coloring
berger
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Melnikov's valency-variety problem
Melnikov
✭
0
Coloring
»
Vertex coloring
asp
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Extremal G.T.
asp
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Coloring
»
Vertex coloring
Andrew King
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Basic G.T.
andreasruedinger
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
End-Devouring Rays
Georgakopoulos
✭
1
Infinite Graphs
Agelos
« first
‹ previous
1
2
3
4
5
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