Graph Theory

TitleAuthor(s)Imp.¹sort iconRec.²Topic » SubtopicPosted by
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
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Basic G.T.mdevos
Edge Reconstruction ConjectureHarary✭✭✭0melch
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
Total Colouring ConjectureBehzad✭✭✭0ColoringIradmusa
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Algebraic G.T.mdevos
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0Infinite Graphsmdevos
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Directed Graphsmdevos
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Directed Graphs » Tournamentsmdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Edge list coloring conjecture✭✭✭0Coloring » Edge coloringtchow
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Goldberg's conjectureGoldberg✭✭✭0Coloring » Edge coloringmdevos
Shannon capacity of the seven-cycle✭✭✭0tchow
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Coloring » Vertex coloringmdevos
Crossing numbers and coloringAlbertson✭✭✭0Topological G.T. » Crossing numbersmdevos
Shuffle-Exchange Conjecture (graph-theoretic form)Beneš; Folklore; Stone✭✭✭0Vadim Lioubimov
Syndicate content