Open Problem Garden
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
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
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
The three 4-flows conjecture
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Unit vector flows
Jain
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Antichains in the cycle continuous order
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Graceful Tree Conjecture
✭✭✭
0
Coloring
»
Labeling
kintali
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Cores of Cayley graphs
Samal
✭✭✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
Weak pentagon problem
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Coloring
»
Homomorphisms
jfoniok
Circular choosability of planar graphs
Mohar
✭
0
Coloring
»
Homomorphisms
rosskang
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Acyclic edge-colouring
Fiamcik
✭✭
0
Coloring
»
Edge coloring
mdevos
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Coloring
»
Edge coloring
mdevos
List colorings of edge-critical graphs
Mohar
✭✭
0
Coloring
»
Edge coloring
Robert Samal
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Coloring
»
Edge coloring
macajova
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
tchow
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Goldberg's conjecture
Goldberg
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Coloring
»
Edge coloring
fhavet
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Coloring
Gordon Royle
Total Colouring Conjecture
Behzad
✭✭✭
0
Coloring
Iradmusa
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Coloring
mdevos
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Basic G.T.
»
Paths
fhavet
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Seagull problem
Seymour
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Basic G.T.
»
Matchings
mdevos
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Basic G.T.
»
Matchings
Jirka
« first
‹ previous
1
2
3
4
5
next ›
last »
Navigate
more
Recent Activity
3-Edge-Coloring Conjecture
Several ways to apply a (multivalued) multiargument function to a family of filters
Jones' conjecture
Multicolour Erdős--Hajnal Conjecture
Sidorenko's Conjecture
more