Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Total Colouring Conjecture
Behzad
✭✭✭
0
Coloring
Iradmusa
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Infinite Graphs
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
»
Tournaments
mdevos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
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
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Topological G.T.
»
Crossing numbers
cibulka
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Directed Graphs
»
Tournaments
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Directed Graphs
fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Extremal G.T.
asp
Are almost all graphs determined by their spectrum?
✭✭✭
0
mdevos
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
fhavet
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
Jon Noel
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
Cores of Cayley graphs
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
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
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Acyclic edge-colouring
Fiamcik
✭✭
0
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Algorithms
mdevos
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Basic 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