Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Iradmusa
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Topological G.T.
»
Planar graphs
mdevos
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Basic G.T.
»
Matchings
Jirka
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
End-Devouring Rays
Georgakopoulos
✭
1
Infinite Graphs
Agelos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
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
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
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
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Earth-Moon Problem
Ringel
✭✭
1
Coloring
»
Vertex coloring
fhavet
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Choosability of Graph Powers
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Extremal G.T.
Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
« 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