Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Infinite Graphs
mdevos
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Seagull problem
Seymour
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Hypergraphs
mdevos
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Random stable roommates
Mertens
✭✭
0
Basic G.T.
»
Matchings
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Algorithms
fhavet
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Basic G.T.
»
Paths
fhavet
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Oriented chromatic number of planar graphs
✭✭
0
Coloring
»
Vertex coloring
Robert Samal
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Extremal G.T.
fhavet
Odd cycles and low oddness
✭✭
0
Gagik
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Probabilistic G.T.
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
»
Tournaments
mdevos
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
fhavet
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
fhavet
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Melnikov's valency-variety problem
Melnikov
✭
0
Coloring
»
Vertex coloring
asp
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Basic G.T.
»
Matchings
Jirka
Matching cut and girth
✭✭
0
w
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
Lovász Path Removal Conjecture
Lovasz
✭✭
0
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Directed Graphs
fhavet
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Coloring
Jon Noel
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Coloring
»
Vertex coloring
David Wood
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
List colorings of edge-critical graphs
Mohar
✭✭
0
Coloring
»
Edge coloring
Robert Samal
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Coloring
»
Vertex coloring
fhavet
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Coloring
berger
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Topological G.T.
»
Drawings
taxipom
« 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