Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Melnikov's valency-variety problem
Melnikov
✭
0
Graph Theory
»
Coloring
»
Vertex coloring
asp
Earth-Moon Problem
Ringel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Choosability of Graph Powers
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
The Two Color Conjecture
Neumann-Lara
✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Woodall's Conjecture
Woodall
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
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