Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
List chromatic number and maximum degree of bipartite graphs
Alon
✭✭
0
Coloring
»
Vertex coloring
fhavet
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Crossing numbers and coloring
Albertson
✭✭✭
0
Topological G.T.
»
Crossing numbers
mdevos
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Algorithms
fhavet
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Coloring
»
Vertex coloring
berger
Strong matchings and covers
Aharoni
✭✭✭
0
Infinite Graphs
mdevos
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Directed Graphs
fhavet
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Large induced forest in a planar graph.
Abertson
;
Berman
✭✭
0
Topological G.T.
fhavet
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Consecutive non-orientable embedding obstructions
✭✭✭
0
Topological G.T.
»
Genus
Bruce Richter
The Crossing Number of the Complete Graph
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
Triangle free strongly regular graphs
✭✭✭
0
Algebraic G.T.
mdevos
Graceful Tree Conjecture
✭✭✭
0
Coloring
»
Labeling
kintali
Oriented chromatic number of planar graphs
✭✭
0
Coloring
»
Vertex coloring
Robert Samal
Edge list coloring conjecture
✭✭✭
0
Coloring
»
Edge coloring
tchow
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Odd cycles and low oddness
✭✭
0
Gagik
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Matching cut and girth
✭✭
0
w
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Extremal G.T.
asp
Are almost all graphs determined by their spectrum?
✭✭✭
0
mdevos
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Iradmusa
« first
‹ previous
1
2
3
4
5
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