Graph Theory


TitleAuthor(s)Imp.¹sort iconRec.²Topic » SubtopicPosted by
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
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Beneš Conjecture (graph-theoretic form)Beneš✭✭✭0Vadim Lioubimov
Strong 5-cycle double cover conjectureArthur; Hoffmann-Ostenhof✭✭✭1Basic G.T. » Cyclesarthur
Vertex Coloring of graph fractional powersIradmusa✭✭✭1Iradmusa
Oriented trees in n-chromatic digraphsBurr✭✭✭0Directed Graphsfhavet
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Directed Graphs » Tournamentsfhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Directed Graphsfhavet
Ádám's ConjectureÁdám✭✭✭0Directed Graphsfhavet
Splitting a digraph with minimum outdegree constraintsAlon✭✭✭0Directed Graphsfhavet
Long directed cycles in diregular digraphsJackson✭✭✭0Directed Graphsfhavet
Decomposing a connected graph into paths.Gallai✭✭✭0Basic G.T. » Pathsfhavet
Acyclic list colouring of planar graphs.Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena✭✭✭0Coloring » Vertex coloringfhavet
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Directed Graphsfhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing✭✭✭0Extremal G.T.asp
Are almost all graphs determined by their spectrum?✭✭✭0mdevos
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Coloring » Vertex coloringJon Noel
3-Decomposition ConjectureArthur; Hoffmann-Ostenhof✭✭✭0arthur
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Directed Graphsfhavet
Cycle Double Covers Containing Predefined 2-Regular SubgraphsArthur; Hoffmann-Ostenhof✭✭✭0arthur
Monochromatic vertex colorings inherited from Perfect Matchings✭✭✭1Mario Krenn
The three 4-flows conjectureDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
Real roots of the flow polynomialWelsh✭✭0Coloring » Nowhere-zero flowsmdevos
Unit vector flowsJain✭✭0Coloring » Nowhere-zero flowsmdevos
Packing T-joinsDeVos✭✭0Coloring » Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Coloring » Edge coloringmdevos
Partitioning edge-connectivityDeVos✭✭0Basic G.T. » Connectivitymdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
Graham's conjecture on tree reconstructionGraham✭✭0Basic G.T.mdevos
The Two Color ConjectureNeumann-Lara✭✭0Directed Graphsmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Coloring » Edge coloringmdevos
The Crossing Number of the HypercubeErdos; Guy✭✭0Topological G.T. » Crossing numbersRobert Samal
Syndicate content