Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
jcmeyer
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Directed Graphs
JS
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Directed Graphs
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
fhavet
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Coloring random subgraphs
Bukh
✭✭
0
Probabilistic G.T.
mdevos
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Algorithms
mdevos
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Infinite Graphs
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Infinite Graphs
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Infinite Graphs
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
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
Antichains in the cycle continuous order
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Coloring
»
Vertex coloring
mdevos
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Topological G.T.
»
Planar graphs
mdevos
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Infinite Graphs
mdevos
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Extremal G.T.
fhavet
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Infinite Graphs
mdevos
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
Jon Noel
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Coloring
»
Vertex coloring
DFR
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Coloring
»
Edge coloring
fhavet
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
fhavet
Exact colorings of graphs
Erickson
✭✭
0
Martin Erickson
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Topological G.T.
»
Coloring
David Wood
Acyclic edge-colouring
Fiamcik
✭✭
0
Coloring
»
Edge coloring
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