Graph Theory


Titlesort iconAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted by
Large induced forest in a planar graph.Abertson; Berman✭✭0Topological G.T.fhavet
Large acyclic induced subdigraph in a planar oriented graph.Harutyunyan✭✭0Directed Graphsfhavet
Laplacian Degrees of a GraphGuo✭✭0Algebraic G.T.Robert Samal
Kriesell's ConjectureKriesell✭✭0Basic G.T. » ConnectivityJon Noel
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Jaeger's modular orientation conjectureJaeger✭✭✭0Coloring » Nowhere-zero flowsmdevos
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Imbalance conjectureKozerenko✭✭0Sergiy Kozerenko
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Directed Graphsfhavet
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Algebraic G.T.mdevos
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in line graphs of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0Basic G.T. » CyclesRobert Samal
Hamilton decomposition of prisms over 3-connected cubic planar graphsAlspach; Rosenfeld✭✭0Basic G.T. » Cyclesfhavet
Hamilton cycle in small d-diregular graphsJackson✭✭0Directed Graphsfhavet
Half-integral flow polynomial valuesMohar✭✭0Algebraic G.T.mohar
Grunbaum's ConjectureGrunbaum✭✭✭0Topological G.T. » Coloringmdevos
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Coloring » Vertex coloringmdevos
Graham's conjecture on tree reconstructionGraham✭✭0Basic G.T.mdevos
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0Coloring » LabelingDOT
Goldberg's conjectureGoldberg✭✭✭0Coloring » Edge coloringmdevos
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1Basic G.T. » CyclesAgelos
Friendly partitionsDeVos✭✭0Basic G.T.mdevos
Frankl's union-closed sets conjectureFrankl✭✭0Hypergraphstchow
Fractional HadwigerHarvey; Reed; Seymour; Wood✭✭1David Wood
Forcing a 2-regular minorReed; Wood✭✭1Basic G.T. » MinorsDavid Wood
Forcing a $K_6$-minorBarát ; Joret; Wood✭✭0Basic G.T. » MinorsDavid Wood
Finding k-edge-outerplanar graph embeddingsBentz✭✭0jcmeyer
Faithful cycle coversSeymour✭✭✭0Basic G.T. » Cyclesmdevos
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Extremal G.T.shudeshijie
Exact colorings of graphsErickson✭✭0Martin Erickson
Every prism over a 3-connected planar graph is hamiltonian.Kaiser; Král; Rosenfeld; Ryjácek; Voss✭✭0Basic G.T. » Cyclesfhavet
Every 4-connected toroidal graph has a Hamilton cycleGrunbaum; Nash-Williams✭✭0Topological G.T.fhavet
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Coloring » Vertex coloringJon Noel
Erdős-Posa property for long directed cyclesHavet; Maia✭✭0Directed Graphsfhavet
End-Devouring RaysGeorgakopoulos1Infinite GraphsAgelos
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.Thomassen✭✭0Directed Graphs » Tournamentsfhavet
Edge Reconstruction ConjectureHarary✭✭✭0melch
Edge list coloring conjecture✭✭✭0Coloring » Edge coloringtchow
Earth-Moon ProblemRingel✭✭1Coloring » Vertex coloringfhavet
Drawing disconnected graphs on surfacesDeVos; Mohar; Samal✭✭0Topological G.T. » Crossing numbersmdevos
Double-critical graph conjectureErdos; Lovasz✭✭0Coloring » Vertex coloringDFR
Domination in plane triangulationsMatheson; Tarjan✭✭0Topological G.T.mdevos
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
Does the chromatic symmetric function distinguish between trees?Stanley✭✭0Algebraic G.T.mdevos
Syndicate content