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
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Triangle free strongly regular graphs
✭✭✭
0
Algebraic G.T.
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Infinite Graphs
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Coloring
»
Vertex coloring
mdevos
5-local-tensions
DeVos
✭✭
0
Topological G.T.
»
Coloring
mdevos
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Coloring
»
Homomorphisms
mdevos
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Basic G.T.
»
Matchings
mdevos
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
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
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Topological G.T.
»
Coloring
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Basic G.T.
mdevos
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
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
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Coloring
»
Vertex coloring
mdevos
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Goldberg's conjecture
Goldberg
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Algebraic G.T.
mdevos
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Topological G.T.
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Coloring
»
Vertex coloring
mdevos
Domination in cubic graphs
Reed
✭✭
0
Basic G.T.
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Algorithms
mdevos
Friendly partitions
DeVos
✭✭
0
Basic G.T.
mdevos
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
Are almost all graphs determined by their spectrum?
✭✭✭
0
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
melch
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
Half-integral flow polynomial values
Mohar
✭✭
0
Algebraic G.T.
mohar
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
Cores of Cayley graphs
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
« 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