Graph Theory


Titlesort iconAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted by
Goldberg's conjectureGoldberg✭✭✭0Coloring » Edge coloringmdevos
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0Coloring » LabelingDOT
Graham's conjecture on tree reconstructionGraham✭✭0Basic G.T.mdevos
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Coloring » Vertex coloringmdevos
Grunbaum's ConjectureGrunbaum✭✭✭0Topological G.T. » Coloringmdevos
Half-integral flow polynomial valuesMohar✭✭0Algebraic G.T.mohar
Hamilton cycle in small d-diregular graphsJackson✭✭0Directed Graphsfhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphsAlspach; Rosenfeld✭✭0Basic G.T. » Cyclesfhavet
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
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Algebraic G.T.mdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Directed Graphsfhavet
Imbalance conjectureKozerenko✭✭0Sergiy Kozerenko
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Jaeger's modular orientation conjectureJaeger✭✭✭0Coloring » Nowhere-zero flowsmdevos
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
Kriesell's ConjectureKriesell✭✭0Basic G.T. » ConnectivityJon Noel
Laplacian Degrees of a GraphGuo✭✭0Algebraic G.T.Robert Samal
Large acyclic induced subdigraph in a planar oriented graph.Harutyunyan✭✭0Directed Graphsfhavet
Large induced forest in a planar graph.Abertson; Berman✭✭0Topological G.T.fhavet
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
Linial-Berge path partition dualityBerge; Linial✭✭✭0Coloringberger
List chromatic number and maximum degree of bipartite graphsAlon✭✭0Coloring » Vertex coloringfhavet
List colorings of edge-critical graphsMohar✭✭0Coloring » Edge coloringRobert Samal
List Colourings of Complete Multipartite Graphs with 2 Big PartsAllagan✭✭1Coloring » Vertex coloringJon Noel
List Hadwiger ConjectureKawarabayashi; Mohar✭✭0Coloring » Vertex coloringDavid Wood
List Total Colouring ConjectureBorodin; Kostochka; Woodall✭✭0ColoringJon Noel
Long directed cycles in diregular digraphsJackson✭✭✭0Directed Graphsfhavet
Lovász Path Removal ConjectureLovasz✭✭0fhavet
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
Matching cut and girth✭✭0w
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Basic G.T. » MatchingsJirka
Melnikov's valency-variety problemMelnikov0Coloring » Vertex coloringasp
Minimal graphs with a prescribed number of spanning treesAzarija; Skrekovski✭✭1azi
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournamentYuster✭✭0fhavet
Mixing Circular ColouringsBrewster; Noel1Coloring » Vertex coloringJon Noel
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Directed Graphsfhavet
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Directed Graphs » Tournamentsmdevos
Monochromatic vertex colorings inherited from Perfect Matchings✭✭✭1Mario Krenn
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Basic G.T.mdevos
Negative association in uniform forestsPemantle✭✭0Probabilistic G.T.mdevos
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Directed Graphsmdevos
Nonrepetitive colourings of planar graphsAlon N.; Grytczuk J.; Hałuszczak M.; Riordan O.✭✭0Coloring » Vertex coloringDavid Wood
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Syndicate content