Graph Theory


TitleAuthor(s)Imp.¹Rec.²sort iconTopic » SubtopicPosted by
What is the largest graph of positive curvature?DeVos; Mohar1Topological G.T. » Planar graphsmdevos
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1Basic G.T. » CyclesAgelos
Coloring and immersionAbu-Khzam; Langston✭✭✭1Coloring » Vertex coloringmdevos
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Basic G.T. » MatchingsJirka
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
End-Devouring RaysGeorgakopoulos1Infinite GraphsAgelos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Basic G.T. » Cyclestchow
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
3-Colourability of Arrangements of Great CirclesFelsner; Hurtado; Noy; Streinu✭✭1Topological G.T. » ColoringDavid Wood
Strong 5-cycle double cover conjectureArthur; Hoffmann-Ostenhof✭✭✭1Basic G.T. » Cyclesarthur
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Robert Samal
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Extremal G.T.shudeshijie
Vertex Coloring of graph fractional powersIradmusa✭✭✭1Iradmusa
Obstacle number of planar graphsAlpert; Koch; Laison1Andrew King
Minimal graphs with a prescribed number of spanning treesAzarija; Skrekovski✭✭1azi
Mixing Circular ColouringsBrewster; Noel1Coloring » Vertex coloringJon Noel
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Coloring » Vertex coloringJon Noel
Earth-Moon ProblemRingel✭✭1Coloring » Vertex coloringfhavet
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Coloring » Vertex coloringJon Noel
Choosability of Graph PowersNoel✭✭1Coloring » Vertex coloringJon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Basic G.T.mhaythorpe
Fractional HadwigerHarvey; Reed; Seymour; Wood✭✭1David Wood
Forcing a 2-regular minorReed; Wood✭✭1Basic G.T. » MinorsDavid Wood
List Colourings of Complete Multipartite Graphs with 2 Big PartsAllagan✭✭1Coloring » Vertex coloringJon Noel
Weak saturation of the cube in the cliqueMorrison; Noel1Extremal G.T.Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings✭✭✭1Mario Krenn
Cores of Cayley graphsSamal✭✭✭✭✭0Coloring » HomomorphismsRobert Samal
5-flow conjectureTutte✭✭✭✭0Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Coloring » Nowhere-zero flowsmdevos
Bouchet's 6-flow conjectureBouchet✭✭✭0Coloring » Nowhere-zero flowsmdevos
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
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
The circular embedding conjectureHaggard✭✭✭0Basic G.T. » Cyclesmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Basic G.T. » Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Basic G.T. » Cyclesmdevos
Decomposing eulerian graphs✭✭✭0Basic G.T. » Cyclesmdevos
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
Petersen coloring conjectureJaeger✭✭✭0Coloring » Edge coloringmdevos
Packing T-joinsDeVos✭✭0Coloring » Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Coloring » Edge coloringmdevos
Partitioning edge-connectivityDeVos✭✭0Basic G.T. » Connectivitymdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Basic G.T. » Minorsmdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
57-regular Moore graph?Hoffman; Singleton✭✭✭0Algebraic G.T.mdevos
Syndicate content