Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Directed Graphs
fhavet
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Directed Graphs
»
Tournaments
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
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Basic G.T.
»
Paths
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Directed Graphs
fhavet
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Cores of Cayley graphs
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Consecutive non-orientable embedding obstructions
✭✭✭
0
Topological G.T.
»
Genus
Bruce Richter
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Extremal G.T.
fhavet
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Basic G.T.
mdevos
Colouring the square of a planar graph
Wegner
✭✭
0
Coloring
»
Vertex coloring
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Coloring
fhavet
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Probabilistic G.T.
mdevos
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Eckhard Steffen
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Coloring
»
Vertex coloring
mdevos
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Coloring
»
Vertex coloring
mdevos
Circular choosability of planar graphs
Mohar
✭
0
Coloring
»
Homomorphisms
rosskang
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Probabilistic G.T.
DOT
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
David Wood
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Iradmusa
Chords of longest cycles
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Choosability of Graph Powers
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Infinite Graphs
mdevos
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Directed Graphs
fhavet
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Coloring
»
Vertex coloring
Andrew King
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Vadim Lioubimov
Barnette's Conjecture
Barnette
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Asymptotic Distribution of Form of Polyhedra
Rüdinger
✭✭
0
Basic G.T.
andreasruedinger
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Topological G.T.
»
Crossing numbers
cibulka
Are almost all graphs determined by their spectrum?
✭✭✭
0
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