Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Earth-Moon Problem
Ringel
✭✭
1
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
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
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Coloring
»
Vertex coloring
fhavet
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Algorithms
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Directed Graphs
fhavet
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Directed Graphs
fhavet
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Directed Graphs
fhavet
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Directed Graphs
fhavet
Choosability of Graph Powers
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Kriesell's Conjecture
Kriesell
✭✭
0
Basic G.T.
»
Connectivity
Jon Noel
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
Imbalance conjecture
Kozerenko
✭✭
0
Sergiy Kozerenko
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Coloring
»
Vertex coloring
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
David Wood
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Eckhard Steffen
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Coloring
»
Vertex coloring
Jon Noel
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Iradmusa
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
The circular embedding conjecture
Haggard
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Faithful cycle covers
Seymour
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Basic G.T.
»
Minors
mdevos
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Algebraic G.T.
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