Graph Theory


TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
Kriesell's ConjectureKriesell✭✭0Basic G.T. » ConnectivityJon Noel
Complexity of the H-factor problem.Kühn; Osthus✭✭0Extremal G.T.fhavet
Simultaneous partition of hypergraphsKühn; Osthus✭✭0Hypergraphsfhavet
Stable set meeting all longest directed paths.Laborde; Payan; Xuong N.H.✭✭0fhavet
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Algebraic G.T.mdevos
Lovász Path Removal ConjectureLovasz✭✭0fhavet
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
Subdivision of a transitive tournament in digraphs with large outdegree. Mader✭✭0Directed Graphsfhavet
Domination in plane triangulationsMatheson; Tarjan✭✭0Topological G.T.mdevos
Weighted colouring of hexagonal graphs.McDiarmid; Reed✭✭0Coloring » Vertex coloringfhavet
Melnikov's valency-variety problemMelnikov0Coloring » Vertex coloringasp
Random stable roommatesMertens✭✭0Basic G.T. » Matchingsmdevos
Universal point sets for planar graphsMohar✭✭✭0Topological G.T. » Drawingsmdevos
Half-integral flow polynomial valuesMohar✭✭0Algebraic G.T.mohar
List colorings of edge-critical graphsMohar✭✭0Coloring » Edge coloringRobert Samal
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Circular choosability of planar graphsMohar0Coloring » Homomorphismsrosskang
Weak saturation of the cube in the cliqueMorrison; Noel1Extremal G.T.Jon Noel
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Coloring » Vertex coloringJon Noel
Choosability of Graph PowersNoel✭✭1Coloring » Vertex coloringJon Noel
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Three-chromatic (0,2)-graphsPayan✭✭0ColoringGordon Royle
Negative association in uniform forestsPemantle✭✭0Probabilistic G.T.mdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Reed's omega, delta, and chi conjectureReed✭✭✭0Coloring » Vertex coloringmdevos
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
Forcing a 2-regular minorReed; Wood✭✭1Basic G.T. » MinorsDavid Wood
Earth-Moon ProblemRingel✭✭1Coloring » Vertex coloringfhavet
A generalization of Vizing's Theorem?Rosenfeld✭✭0Coloring » Edge coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Algorithmsmdevos
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Basic G.T.andreasruedinger
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Basic G.T. » MatchingsJirka
Ryser's conjectureRyser✭✭✭0Hypergraphsmdevos
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.Sabidussi✭✭0Basic G.T. » Cyclesfhavet
Cores of Cayley graphsSamal✭✭✭✭✭0Coloring » HomomorphismsRobert Samal
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Directed Graphs » Tournamentsmdevos
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Directed Graphsfhavet
Faithful cycle coversSeymour✭✭✭0Basic G.T. » Cyclesmdevos
Seymour's self-minor conjectureSeymour✭✭✭0Infinite Graphsmdevos
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
Seagull problemSeymour✭✭✭0Basic G.T. » Minorsmdevos
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Sidorenko's ConjectureSidorenko✭✭✭0Jon Noel
Syndicate content