Graph Theory

TitleAuthor(s)Imp.¹sort iconRec.²Topic » SubtopicPosted by
5-flow conjectureTutte✭✭✭✭0Coloring » Nowhere-zero flowsmdevos
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
Reconstruction conjectureKelly; Ulam✭✭✭✭0zitterbewegung
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Directed Graphsfhavet
4-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Coloring » Nowhere-zero flowsmdevos
Bouchet's 6-flow conjectureBouchet✭✭✭0Coloring » Nowhere-zero flowsmdevos
The circular embedding conjectureHaggard✭✭✭0Basic G.T. » Cyclesmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Basic G.T. » Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Basic G.T. » Cyclesmdevos
Decomposing eulerian graphs✭✭✭0Basic G.T. » Cyclesmdevos
Petersen coloring conjectureJaeger✭✭✭0Coloring » Edge coloringmdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
57-regular Moore graph?Hoffman; Singleton✭✭✭0Algebraic G.T.mdevos
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Algebraic G.T.mdevos
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Extremal G.T.mdevos
Ryser's conjectureRyser✭✭✭0Hypergraphsmdevos
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
Linial-Berge path partition dualityBerge; Linial✭✭✭0Coloringberger
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Coloring » Vertex coloringberger
Consecutive non-orientable embedding obstructions✭✭✭0Topological G.T. » GenusBruce Richter
Grunbaum's ConjectureGrunbaum✭✭✭0Topological G.T. » Coloringmdevos
Woodall's ConjectureWoodall✭✭✭0Directed Graphsmdevos
The Crossing Number of the Complete Graph✭✭✭0Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Topological G.T. » Crossing numbersRobert Samal
Universal point sets for planar graphsMohar✭✭✭0Topological G.T. » Drawingsmdevos
Seymour's self-minor conjectureSeymour✭✭✭0Infinite Graphsmdevos
Reed's omega, delta, and chi conjectureReed✭✭✭0Coloring » Vertex coloringmdevos
Triangle free strongly regular graphs✭✭✭0Algebraic G.T.mdevos
Unions of triangle free graphsErdos; Hajnal✭✭✭0Infinite Graphsmdevos
Ramsey properties of Cayley graphsAlon✭✭✭0Algebraic G.T.mdevos
Barnette's ConjectureBarnette✭✭✭0Basic G.T. » CyclesRobert Samal
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
Graceful Tree Conjecture✭✭✭0Coloring » Labelingkintali
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0Basic G.T. » CyclesRobert Samal
Coloring and immersionAbu-Khzam; Langston✭✭✭1Coloring » Vertex coloringmdevos
Pebbling a cartesian productGraham✭✭✭0mdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Unfriendly partitionsCowan; Emerson✭✭✭0Infinite Graphsmdevos
Strong matchings and coversAharoni✭✭✭0Infinite Graphsmdevos
Chords of longest cyclesThomassen✭✭✭0Basic G.T. » Cyclesmdevos
Seagull problemSeymour✭✭✭0Basic G.T. » Minorsmdevos
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Coloring » Vertex coloringIradmusa
Partial List ColoringIradmusa✭✭✭0Coloring » Vertex coloringIradmusa
Syndicate content