Graph Theory


TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
Partitioning edge-connectivityDeVos✭✭0Basic G.T. » Connectivitymdevos
Antichains in the cycle continuous orderDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
5-local-tensionsDeVos✭✭0Topological G.T. » Coloringmdevos
Friendly partitionsDeVos✭✭0Basic G.T.mdevos
Unfriendly partitionsCowan; Emerson✭✭✭0Infinite Graphsmdevos
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Directed Graphsmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Basic G.T. » Cyclesmdevos
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Algebraic G.T.mdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Directed Graphsfhavet
Oriented trees in n-chromatic digraphsBurr✭✭✭0Directed Graphsfhavet
Coloring random subgraphsBukh✭✭0Probabilistic G.T.mdevos
Mixing Circular ColouringsBrewster; Noel1Coloring » Vertex coloringJon Noel
Cycles in Graphs of Large Chromatic NumberBrewster; McGuinness; Moore; Noel✭✭0Coloring » Vertex coloringJon Noel
Bouchet's 6-flow conjectureBouchet✭✭✭0Coloring » Nowhere-zero flowsmdevos
List Total Colouring ConjectureBorodin; Kostochka; Woodall✭✭0ColoringJon Noel
The Borodin-Kostochka ConjectureBorodin; Kostochka✭✭0Andrew King
Acyclic list colouring of planar graphs.Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena✭✭✭0Coloring » Vertex coloringfhavet
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Switching reconstruction of digraphsBondy; Mercier✭✭0fhavet
Cyclic spanning subdigraph with small cyclomatic numberBondy✭✭0Directed Graphsfhavet
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
Signing a graph to have small magnitude eigenvaluesBilu; Linial✭✭0mdevos
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Linial-Berge path partition dualityBerge; Linial✭✭✭0Coloringberger
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
Approximation Ratio for Maximum Edge Disjoint Paths problemBentz✭✭0jcmeyer
Approximation ratio for k-outerplanar graphsBentz✭✭0jcmeyer
Finding k-edge-outerplanar graph embeddingsBentz✭✭0jcmeyer
Shuffle-Exchange Conjecture (graph-theoretic form)Beneš; Folklore; Stone✭✭✭0Vadim Lioubimov
Beneš Conjecture (graph-theoretic form)Beneš✭✭✭0Vadim Lioubimov
Total Colouring ConjectureBehzad✭✭✭0ColoringIradmusa
Barnette's ConjectureBarnette✭✭✭0Basic G.T. » CyclesRobert Samal
Forcing a $K_6$-minorBarát ; Joret; Wood✭✭0Basic G.T. » MinorsDavid Wood
Arc-disjoint strongly connected spanning subdigraphsBang-Jensen; Yeo✭✭0fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphsBang-Jensen; Yeo✭✭0Directed Graphs » Tournamentsfhavet
Minimal graphs with a prescribed number of spanning treesAzarija; Skrekovski✭✭1azi
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
Crossing sequencesArchdeacon; Bonnington; Siran✭✭0Topological G.T. » Crossing numbersRobert Samal
Good Edge LabelingsAraújo; Cohen; Giroire; Havet✭✭0Coloring » LabelingDOT
Chromatic number of random lifts of complete graphsAmit✭✭0Probabilistic G.T.DOT
Hamilton decomposition of prisms over 3-connected cubic planar graphsAlspach; Rosenfeld✭✭0Basic G.T. » Cyclesfhavet
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Directed Graphs » Tournamentsfhavet
Obstacle number of planar graphsAlpert; Koch; Laison1Andrew King
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Basic G.T.mdevos
Arc-disjoint directed cycles in regular directed graphsAlon; McDiarmid; Molloy✭✭0Directed Graphsfhavet
Syndicate content