Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Coloring
»
Vertex coloring
mdevos
Laplacian Degrees of a Graph
Guo
✭✭
0
Algebraic G.T.
Robert Samal
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
Weak pentagon problem
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Graceful Tree Conjecture
✭✭✭
0
Coloring
»
Labeling
kintali
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Infinite Graphs
Robert Samal
Oriented chromatic number of planar graphs
✭✭
0
Coloring
»
Vertex coloring
Robert Samal
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Basic G.T.
»
Matchings
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Hypergraphs
Dino
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Coloring
Gordon Royle
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Extremal G.T.
boris
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Topological G.T.
»
Drawings
taxipom
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Directed Graphs
JS
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Coloring
»
Edge coloring
macajova
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Basic G.T.
»
Cycles
cmlee
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Infinite Graphs
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Infinite Graphs
mdevos
Strong matchings and covers
Aharoni
✭✭✭
0
Infinite Graphs
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Infinite Graphs
mdevos
Chords of longest cycles
Thomassen
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Seagull problem
Seymour
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Random stable roommates
Mertens
✭✭
0
Basic G.T.
»
Matchings
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Total Colouring Conjecture
Behzad
✭✭✭
0
Coloring
Iradmusa
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Algebraic G.T.
mdevos
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Basic G.T.
mdevos
Coloring random subgraphs
Bukh
✭✭
0
Probabilistic G.T.
mdevos
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Coloring
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Infinite Graphs
mdevos
Negative association in uniform forests
Pemantle
✭✭
0
Probabilistic G.T.
mdevos
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Directed Graphs
»
Tournaments
mdevos
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
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
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