Graph Theory

TitleAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted bysort icon
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1Basic G.T. » CyclesAgelos
End-Devouring RaysGeorgakopoulos1Infinite GraphsAgelos
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Basic G.T.andreasruedinger
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Coloring » Vertex coloringAndrew King
Covering powers of cycles with equivalence subgraphs0Andrew King
Obstacle number of planar graphsAlpert; Koch; Laison1Andrew King
The Borodin-Kostochka ConjectureBorodin; Kostochka✭✭0Andrew King
Strong 5-cycle double cover conjectureArthur; Hoffmann-Ostenhof✭✭✭1Basic G.T. » Cyclesarthur
3-Decomposition ConjectureArthur; Hoffmann-Ostenhof✭✭✭0arthur
Cycle Double Covers Containing Predefined 2-Regular SubgraphsArthur; Hoffmann-Ostenhof✭✭✭0arthur
Melnikov's valency-variety problemMelnikov0Coloring » Vertex coloringasp
The Bollobás-Eldridge-Catlin Conjecture on graph packing✭✭✭0Extremal G.T.asp
Minimal graphs with a prescribed number of spanning treesAzarija; Skrekovski✭✭1azi
Linial-Berge path partition dualityBerge; Linial✭✭✭0Coloringberger
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Coloring » Vertex coloringberger
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Extremal G.T.boris
Consecutive non-orientable embedding obstructions✭✭✭0Topological G.T. » GenusBruce Richter
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Separators in string graphsFox; Pach; Tóth✭✭0cibulka
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
3-Colourability of Arrangements of Great CirclesFelsner; Hurtado; Noy; Streinu✭✭1Topological G.T. » ColoringDavid Wood
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Forcing a $K_6$-minorBarát ; Joret; Wood✭✭0Basic G.T. » MinorsDavid Wood
Fractional HadwigerHarvey; Reed; Seymour; Wood✭✭1David Wood
Forcing a 2-regular minorReed; Wood✭✭1Basic G.T. » MinorsDavid Wood
Nonrepetitive colourings of planar graphsAlon N.; Grytczuk J.; Hałuszczak M.; Riordan O.✭✭0Coloring » Vertex coloringDavid Wood
List Hadwiger ConjectureKawarabayashi; Mohar✭✭0Coloring » Vertex coloringDavid Wood
Chromatic Number of Common GraphsHatami; Hladký; Kráľ; Norine; Razborov✭✭0David Wood
Double-critical graph conjectureErdos; Lovasz✭✭0Coloring » Vertex coloringDFR
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0Coloring » LabelingDOT
Chromatic number of random lifts of complete graphsAmit✭✭0Probabilistic G.T.DOT
Circular flow number of regular class 1 graphsSteffen✭✭0Coloring » Nowhere-zero flowsEckhard Steffen
Circular flow numbers of $r$-graphsSteffen✭✭0Eckhard Steffen
Oriented trees in n-chromatic digraphsBurr✭✭✭0Directed Graphsfhavet
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Directed Graphs » Tournamentsfhavet
Antidirected trees in digraphsAddario-Berry; Havet; Linhares Sales; Reed; Thomassé✭✭0Directed Graphsfhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Directed Graphsfhavet
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Directed Graphsfhavet
Ádám's ConjectureÁdám✭✭✭0Directed Graphsfhavet
Stable set meeting all longest directed paths.Laborde; Payan; Xuong N.H.✭✭0fhavet
Splitting a digraph with minimum outdegree constraintsAlon✭✭✭0Directed Graphsfhavet
Long directed cycles in diregular digraphsJackson✭✭✭0Directed Graphsfhavet
Strong edge colouring conjectureErdos; Nesetril✭✭0Coloring » Edge coloringfhavet
Arc-disjoint out-branching and in-branchingThomassen✭✭0Directed Graphsfhavet
Arc-disjoint strongly connected spanning subdigraphsBang-Jensen; Yeo✭✭0fhavet
Coloring the union of degenerate graphsTarsi✭✭0Coloringfhavet
Do any three longest paths in a connected graph have a vertex in common? Gallai✭✭0fhavet
Decomposing a connected graph into paths.Gallai✭✭✭0Basic G.T. » Pathsfhavet
Syndicate content