Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
Covering powers of cycles with equivalence subgraphs
✭
0
Andrew King
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Matching cut and girth
✭✭
0
w
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
fhavet
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
fhavet
Lovász Path Removal Conjecture
Lovasz
✭✭
0
fhavet
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
fhavet
Switching reconstruction conjecture
Stanley
✭✭
0
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
fhavet
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
Are almost all graphs determined by their spectrum?
✭✭✭
0
mdevos
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournament
Yuster
✭✭
0
fhavet
Imbalance conjecture
Kozerenko
✭✭
0
Sergiy Kozerenko
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
David Wood
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Eckhard Steffen
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
arthur
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Jon Noel
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
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