Graph Theory


Titlesort iconAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted by
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the Complete Graph✭✭✭0Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the HypercubeErdos; Guy✭✭0Topological G.T. » Crossing numbersRobert Samal
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Extremal G.T.mdevos
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
The three 4-flows conjectureDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
Three-chromatic (0,2)-graphsPayan✭✭0ColoringGordon Royle
Total Colouring ConjectureBehzad✭✭✭0ColoringIradmusa
Triangle free strongly regular graphs✭✭✭0Algebraic G.T.mdevos
Triangle-packing vs triangle edge-transversal.Tuza✭✭0Extremal G.T.fhavet
Turán number of a finite family.Erdos; Simonovits✭✭0fhavet
Turán's problem for hypergraphsTuran✭✭0Hypergraphsfhavet
Unfriendly partitionsCowan; Emerson✭✭✭0Infinite Graphsmdevos
Unions of triangle free graphsErdos; Hajnal✭✭✭0Infinite Graphsmdevos
Unit vector flowsJain✭✭0Coloring » Nowhere-zero flowsmdevos
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Universal point sets for planar graphsMohar✭✭✭0Topological G.T. » Drawingsmdevos
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Coloring » Edge coloringmacajova
Vertex Coloring of graph fractional powersIradmusa✭✭✭1Iradmusa
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Weak saturation of the cube in the cliqueMorrison; Noel1Extremal G.T.Jon Noel
Weighted colouring of hexagonal graphs.McDiarmid; Reed✭✭0Coloring » Vertex coloringfhavet
What is the largest graph of positive curvature?DeVos; Mohar1Topological G.T. » Planar graphsmdevos
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Extremal G.T.boris
Woodall's ConjectureWoodall✭✭✭0Directed Graphsmdevos
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Syndicate content