Graph Theory


TitleAuthor(s)Imp.¹Rec.²sort iconTopic » SubtopicPosted by
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
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
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
A generalization of Vizing's Theorem?Rosenfeld✭✭0Coloring » Edge coloringmdevos
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
The Crossing Number of the HypercubeErdos; Guy✭✭0Topological G.T. » Crossing numbersRobert Samal
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
Triangle free strongly regular graphs✭✭✭0Algebraic G.T.mdevos
Half-integral flow polynomial valuesMohar✭✭0Algebraic G.T.mohar
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
List colorings of edge-critical graphsMohar✭✭0Coloring » Edge coloringRobert Samal
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Coloring » Vertex coloringmdevos
Laplacian Degrees of a GraphGuo✭✭0Algebraic G.T.Robert Samal
5-local-tensionsDeVos✭✭0Topological G.T. » Coloringmdevos
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Graceful Tree Conjecture✭✭✭0Coloring » Labelingkintali
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0Basic G.T. » CyclesRobert Samal
Hamiltonian cycles in line graphs of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Oriented chromatic number of planar graphs✭✭0Coloring » Vertex coloringRobert Samal
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Three-chromatic (0,2)-graphsPayan✭✭0ColoringGordon Royle
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Extremal G.T.boris
Pebbling a cartesian productGraham✭✭✭0mdevos
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Coloring » Edge coloringmacajova
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Reconstruction conjectureKelly; Ulam✭✭✭✭0zitterbewegung
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Syndicate content