Graph Theory

TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
Linial-Berge path partition dualityBerge; Linial✭✭✭0Coloringberger
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Signing a graph to have small magnitude eigenvaluesBilu; Linial✭✭0mdevos
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
Cyclic spanning subdigraph with small cyclomatic numberBondy✭✭0Directed Graphsfhavet
Switching reconstruction of digraphsBondy; Mercier✭✭0fhavet
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Acyclic list colouring of planar graphs.Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena✭✭✭0Coloring » Vertex coloringfhavet
The Borodin-Kostochka ConjectureBorodin; Kostochka✭✭0Andrew King
List Total Colouring ConjectureBorodin; Kostochka; Woodall✭✭0ColoringJon Noel
Bouchet's 6-flow conjectureBouchet✭✭✭0Coloring » Nowhere-zero flowsmdevos
Cycles in Graphs of Large Chromatic NumberBrewster; McGuinness; Moore; Noel✭✭0Coloring » Vertex coloringJon Noel
Mixing Circular ColouringsBrewster; Noel1Coloring » Vertex coloringJon Noel
Coloring random subgraphsBukh✭✭0Probabilistic G.T.mdevos
Oriented trees in n-chromatic digraphsBurr✭✭✭0Directed Graphsfhavet
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Directed Graphsfhavet
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Algorithmsmdevos
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Algebraic G.T.mdevos
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Basic G.T. » Cyclesmdevos
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Directed Graphsmdevos
Unfriendly partitionsCowan; Emerson✭✭✭0Infinite Graphsmdevos
The three 4-flows conjectureDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Coloring » Nowhere-zero flowsmdevos
Packing T-joinsDeVos✭✭0Coloring » Edge coloringmdevos
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
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Coloring » Vertex coloringmdevos
What is the largest graph of positive curvature?DeVos; Mohar1Topological G.T. » Planar graphsmdevos
Drawing disconnected graphs on surfacesDeVos; Mohar; Samal✭✭0Topological G.T. » Crossing numbersmdevos
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0Infinite Graphsmdevos
Star chromatic index of cubic graphsDvorak; Mohar; Samal✭✭0Robert Samal
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Robert Samal
Erdős–Faber–Lovász conjectureErdos; Faber; Lovasz✭✭✭0Coloring » Vertex coloringJon Noel
Odd-cycle transversal in triangle-free graphsErdos; Faudree; Pach; Spencer✭✭0Extremal G.T.fhavet
The Crossing Number of the HypercubeErdos; Guy✭✭0Topological G.T. » Crossing numbersRobert Samal
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Extremal G.T.mdevos
Unions of triangle free graphsErdos; Hajnal✭✭✭0Infinite Graphsmdevos
Multicolour Erdős--Hajnal ConjectureErdos; Hajnal✭✭✭0Extremal G.T.Jon Noel
Double-critical graph conjectureErdos; Lovasz✭✭0Coloring » Vertex coloringDFR
Strong edge colouring conjectureErdos; Nesetril✭✭0Coloring » Edge coloringfhavet
Turán number of a finite family.Erdos; Simonovits✭✭0fhavet
Exact colorings of graphsErickson✭✭0Martin Erickson
3-Colourability of Arrangements of Great CirclesFelsner; Hurtado; Noy; Streinu✭✭1Topological G.T. » ColoringDavid Wood
Acyclic edge-colouringFiamcik✭✭0Coloring » Edge coloringmdevos
4-connected graphs are not uniquely hamiltonianFleischner✭✭0Basic G.T. » Cyclesfhavet
Syndicate content