Graph Theory


TitleAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted bysort icon
Choosability of Graph PowersNoel✭✭1Coloring » Vertex coloringJon Noel
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Coloring » Vertex coloringJon Noel
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Coloring » Vertex coloringJon Noel
Kriesell's ConjectureKriesell✭✭0Basic G.T. » ConnectivityJon Noel
List Total Colouring ConjectureBorodin; Kostochka; Woodall✭✭0ColoringJon Noel
List Colourings of Complete Multipartite Graphs with 2 Big PartsAllagan✭✭1Coloring » Vertex coloringJon Noel
Cycles in Graphs of Large Chromatic NumberBrewster; McGuinness; Moore; Noel✭✭0Coloring » Vertex coloringJon Noel
Weak saturation of the cube in the cliqueMorrison; Noel1Extremal G.T.Jon Noel
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Graceful Tree Conjecture✭✭✭0Coloring » Labelingkintali
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Coloring » Edge coloringmacajova
Monochromatic vertex colorings inherited from Perfect Matchings✭✭✭1Mario Krenn
Exact colorings of graphsErickson✭✭0Martin Erickson
5-flow conjectureTutte✭✭✭✭0Coloring » Nowhere-zero flowsmdevos
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 three 4-flows conjectureDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
Real roots of the flow polynomialWelsh✭✭0Coloring » Nowhere-zero flowsmdevos
Unit vector flowsJain✭✭0Coloring » Nowhere-zero flowsmdevos
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
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
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
Petersen coloring conjectureJaeger✭✭✭0Coloring » Edge coloringmdevos
Packing T-joinsDeVos✭✭0Coloring » Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Coloring » Edge coloringmdevos
Partitioning edge-connectivityDeVos✭✭0Basic G.T. » Connectivitymdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
What is the largest graph of positive curvature?DeVos; Mohar1Topological G.T. » Planar graphsmdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
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
Graham's conjecture on tree reconstructionGraham✭✭0Basic G.T.mdevos
Ryser's conjectureRyser✭✭✭0Hypergraphsmdevos
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
Grunbaum's ConjectureGrunbaum✭✭✭0Topological G.T. » Coloringmdevos
Woodall's ConjectureWoodall✭✭✭0Directed Graphsmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Coloring » Edge coloringmdevos
Drawing disconnected graphs on surfacesDeVos; Mohar; Samal✭✭0Topological G.T. » Crossing numbersmdevos
Antichains in the cycle continuous orderDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
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
Syndicate content