Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Coloring
»
Homomorphisms
jfoniok
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Matching cut and girth
✭✭
0
w
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Circular choosability of planar graphs
Mohar
✭
0
Coloring
»
Homomorphisms
rosskang
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Probabilistic G.T.
DOT
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
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
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Coloring
»
Edge coloring
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Directed Graphs
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
fhavet
Melnikov's valency-variety problem
Melnikov
✭
0
Coloring
»
Vertex coloring
asp
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Basic G.T.
»
Cycles
fhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Basic G.T.
»
Cycles
fhavet
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Basic G.T.
»
Paths
fhavet
Lovász Path Removal Conjecture
Lovasz
✭✭
0
fhavet
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Topological G.T.
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Directed Graphs
fhavet
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
fhavet
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Basic G.T.
fhavet
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Extremal G.T.
fhavet
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Hypergraphs
fhavet
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Extremal G.T.
fhavet
Triangle-packing vs triangle edge-transversal.
Tuza
✭✭
0
Extremal G.T.
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Coloring
»
Vertex coloring
fhavet
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Topological G.T.
fhavet
Switching reconstruction conjecture
Stanley
✭✭
0
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Directed Graphs
fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Directed Graphs
fhavet
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Basic G.T.
»
Cycles
fhavet
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Basic G.T.
»
Cycles
fhavet
Turán's problem for hypergraphs
Turan
✭✭
0
Hypergraphs
fhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphs
Alspach
;
Rosenfeld
✭✭
0
Basic G.T.
»
Cycles
fhavet
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Coloring
»
Vertex coloring
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Coloring
»
Vertex coloring
fhavet
« 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