Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Directed Graphs
fhavet
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Directed Graphs
fhavet
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
jcmeyer
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
jcmeyer
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Directed Graphs
fhavet
Antichains in the cycle continuous order
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Coloring
»
Homomorphisms
jfoniok
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
Acyclic edge-colouring
Fiamcik
✭✭
0
Coloring
»
Edge coloring
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Algorithms
mdevos
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Coloring
»
Edge coloring
mdevos
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Algebraic G.T.
mdevos
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Coloring
mdevos
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Basic G.T.
»
Cycles
fhavet
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Topological G.T.
»
Coloring
David Wood
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Graceful Tree Conjecture
✭✭✭
0
Coloring
»
Labeling
kintali
« 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