Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Eckhard Steffen
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Probabilistic G.T.
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
Colouring the square of a planar graph
Wegner
✭✭
0
Coloring
»
Vertex coloring
fhavet
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Basic G.T.
mdevos
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Extremal G.T.
fhavet
Consecutive non-orientable embedding obstructions
✭✭✭
0
Topological G.T.
»
Genus
Bruce Richter
Cores of Cayley graphs
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Directed Graphs
fhavet
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Basic G.T.
»
Cycles
fhavet
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Basic G.T.
»
Cycles
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Directed Graphs
»
Tournaments
fhavet
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
fhavet
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Topological G.T.
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Coloring
»
Vertex coloring
DFR
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Earth-Moon Problem
Ringel
✭✭
1
Coloring
»
Vertex coloring
fhavet
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
tchow
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
End-Devouring Rays
Georgakopoulos
✭
1
Infinite Graphs
Agelos
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Directed Graphs
fhavet
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Topological G.T.
fhavet
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Basic G.T.
»
Cycles
fhavet
Exact colorings of graphs
Erickson
✭✭
0
Martin Erickson
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Faithful cycle covers
Seymour
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
jcmeyer
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
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Hypergraphs
tchow
« 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