Graph Theory


Titlesort iconAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted by
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Obstacle number of planar graphsAlpert; Koch; Laison1Andrew King
Odd cycles and low oddness✭✭0Gagik
Odd-cycle transversal in triangle-free graphsErdos; Faudree; Pach; Spencer✭✭0Extremal G.T.fhavet
Oriented chromatic number of planar graphs✭✭0Coloring » Vertex coloringRobert Samal
Oriented trees in n-chromatic digraphsBurr✭✭✭0Directed Graphsfhavet
Packing T-joinsDeVos✭✭0Coloring » Edge coloringmdevos
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Coloring » Vertex coloringIradmusa
Partial List ColoringIradmusa✭✭✭0Coloring » Vertex coloringIradmusa
Partition of a cubic 3-connected graphs into paths of length 2.Kelmans✭✭0Basic G.T. » Pathsfhavet
Partitioning edge-connectivityDeVos✭✭0Basic G.T. » Connectivitymdevos
Partitionning a tournament into k-strongly connected subtournaments.Thomassen✭✭0Directed Graphs » Tournamentsfhavet
Pebbling a cartesian productGraham✭✭✭0mdevos
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
Petersen coloring conjectureJaeger✭✭✭0Coloring » Edge coloringmdevos
PTAS for feedback arc set in tournamentsAilon; Alon✭✭0Graph Algorithmsfhavet
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Ramsey properties of Cayley graphsAlon✭✭✭0Algebraic G.T.mdevos
Random stable roommatesMertens✭✭0Basic G.T. » Matchingsmdevos
Real roots of the flow polynomialWelsh✭✭0Coloring » Nowhere-zero flowsmdevos
Reconstruction conjectureKelly; Ulam✭✭✭✭0zitterbewegung
Reed's omega, delta, and chi conjectureReed✭✭✭0Coloring » Vertex coloringmdevos
Ryser's conjectureRyser✭✭✭0Hypergraphsmdevos
Seagull problemSeymour✭✭✭0Basic G.T. » Minorsmdevos
Separators in string graphsFox; Pach; Tóth✭✭0cibulka
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
Seymour's self-minor conjectureSeymour✭✭✭0Infinite Graphsmdevos
Shannon capacity of the seven-cycle✭✭✭0tchow
Shuffle-Exchange Conjecture (graph-theoretic form)Beneš; Folklore; Stone✭✭✭0Vadim Lioubimov
Sidorenko's ConjectureSidorenko✭✭✭0Jon Noel
Signing a graph to have small magnitude eigenvaluesBilu; Linial✭✭0mdevos
Simultaneous partition of hypergraphsKühn; Osthus✭✭0Hypergraphsfhavet
Splitting a digraph with minimum outdegree constraintsAlon✭✭✭0Directed Graphsfhavet
Stable set meeting all longest directed paths.Laborde; Payan; Xuong N.H.✭✭0fhavet
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Robert Samal
Star chromatic index of cubic graphsDvorak; Mohar; Samal✭✭0Robert Samal
Strong 5-cycle double cover conjectureArthur; Hoffmann-Ostenhof✭✭✭1Basic G.T. » Cyclesarthur
Strong colorabilityAharoni; Alon; Haxell✭✭✭0Coloring » Vertex coloringberger
Strong edge colouring conjectureErdos; Nesetril✭✭0Coloring » Edge coloringfhavet
Strong matchings and coversAharoni✭✭✭0Infinite Graphsmdevos
Subdivision of a transitive tournament in digraphs with large outdegree. Mader✭✭0Directed Graphsfhavet
Subgraph of large average degree and large girth.Thomassen✭✭0Basic G.T.fhavet
Switching reconstruction conjectureStanley✭✭0fhavet
Switching reconstruction of digraphsBondy; Mercier✭✭0fhavet
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Basic G.T. » Matchingsmdevos
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
The Bollobás-Eldridge-Catlin Conjecture on graph packing✭✭✭0Extremal G.T.asp
The Borodin-Kostochka ConjectureBorodin; Kostochka✭✭0Andrew King
The circular embedding conjectureHaggard✭✭✭0Basic G.T. » Cyclesmdevos
Syndicate content