Graph Theory


TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Negative association in uniform forestsPemantle✭✭0Probabilistic G.T.mdevos
Three-chromatic (0,2)-graphsPayan✭✭0ColoringGordon Royle
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Coloring » Vertex coloringJon Noel
Choosability of Graph PowersNoel✭✭1Coloring » Vertex coloringJon Noel
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
Weak saturation of the cube in the cliqueMorrison; Noel1Extremal G.T.Jon Noel
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
Random stable roommatesMertens✭✭0Basic G.T. » Matchingsmdevos
Melnikov's valency-variety problemMelnikov0Coloring » Vertex coloringasp
Weighted colouring of hexagonal graphs.McDiarmid; Reed✭✭0Coloring » Vertex coloringfhavet
Domination in plane triangulationsMatheson; Tarjan✭✭0Topological G.T.mdevos
Subdivision of a transitive tournament in digraphs with large outdegree. Mader✭✭0Directed Graphsfhavet
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Algebraic G.T.mdevos
Lovász Path Removal ConjectureLovasz✭✭0fhavet
Stable set meeting all longest directed paths.Laborde; Payan; Xuong N.H.✭✭0fhavet
Complexity of the H-factor problem.Kühn; Osthus✭✭0Extremal G.T.fhavet
Simultaneous partition of hypergraphsKühn; Osthus✭✭0Hypergraphsfhavet
Kriesell's ConjectureKriesell✭✭0Basic G.T. » ConnectivityJon Noel
Imbalance conjectureKozerenko✭✭0Sergiy Kozerenko
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Coloring » Vertex coloringAndrew King
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Partition of a cubic 3-connected graphs into paths of length 2.Kelmans✭✭0Basic G.T. » Pathsfhavet
Reconstruction conjectureKelly; Ulam✭✭✭✭0zitterbewegung
List Hadwiger ConjectureKawarabayashi; Mohar✭✭0Coloring » Vertex coloringDavid Wood
Every prism over a 3-connected planar graph is hamiltonian.Kaiser; Král; Rosenfeld; Ryjácek; Voss✭✭0Basic G.T. » Cyclesfhavet
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
Unit vector flowsJain✭✭0Coloring » Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Coloring » Nowhere-zero flowsmdevos
Petersen coloring conjectureJaeger✭✭✭0Coloring » Edge coloringmdevos
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
Long directed cycles in diregular digraphsJackson✭✭✭0Directed Graphsfhavet
Hamilton cycle in small d-diregular graphsJackson✭✭0Directed Graphsfhavet
Partial List ColoringIradmusa✭✭✭0Coloring » Vertex coloringIradmusa
Vertex Coloring of graph fractional powersIradmusa✭✭✭1Iradmusa
57-regular Moore graph?Hoffman; Singleton✭✭✭0Algebraic G.T.mdevos
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Directed Graphsfhavet
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Coloring » Vertex coloringJon Noel
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Basic G.T.mhaythorpe
Erdős-Posa property for long directed cyclesHavet; Maia✭✭0Directed Graphsfhavet
Syndicate content