Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Coloring
»
Vertex coloring
mdevos
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Hypergraphs
tchow
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Coloring
»
Vertex coloring
DFR
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Topological G.T.
»
Coloring
David Wood
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Coloring
»
Vertex coloring
Andrew King
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Topological G.T.
mdevos
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
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Algorithms
mdevos
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Odd cycles and low oddness
✭✭
0
Gagik
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
jcmeyer
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
jcmeyer
Finding k-edge-outerplanar graph embeddings
Bentz
✭✭
0
jcmeyer
Exact colorings of graphs
Erickson
✭✭
0
Martin Erickson
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Coloring
»
Homomorphisms
jfoniok
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Coloring
»
Labeling
DOT
Matching cut and girth
✭✭
0
w
Forcing a $K_6$-minor
Barát
;
Joret
;
Wood
✭✭
0
Basic G.T.
»
Minors
David Wood
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Probabilistic G.T.
DOT
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
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
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
« 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