Graph Theory


Titlesort iconAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted by
Do any three longest paths in a connected graph have a vertex in common? Gallai✭✭0fhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Directed Graphsfhavet
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Decomposing k-arc-strong tournament into k spanning strong digraphsBang-Jensen; Yeo✭✭0Directed Graphs » Tournamentsfhavet
Decomposing eulerian graphs✭✭✭0Basic G.T. » Cyclesmdevos
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Directed Graphs » Tournamentsfhavet
Decomposing an eulerian graph into cycles.Hajós✭✭0Basic G.T. » Cyclesfhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.Sabidussi✭✭0Basic G.T. » Cyclesfhavet
Decomposing a connected graph into paths.Gallai✭✭✭0Basic G.T. » Pathsfhavet
Cyclic spanning subdigraph with small cyclomatic numberBondy✭✭0Directed Graphsfhavet
Cycles in Graphs of Large Chromatic NumberBrewster; McGuinness; Moore; Noel✭✭0Coloring » Vertex coloringJon Noel
Cycle Double Covers Containing Predefined 2-Regular SubgraphsArthur; Hoffmann-Ostenhof✭✭✭0arthur
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
Crossing sequencesArchdeacon; Bonnington; Siran✭✭0Topological G.T. » Crossing numbersRobert Samal
Crossing numbers and coloringAlbertson✭✭✭0Topological G.T. » Crossing numbersmdevos
Covering powers of cycles with equivalence subgraphs0Andrew King
Counting 3-colorings of the hex latticeThomassen✭✭0Coloring » Vertex coloringmdevos
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Algebraic G.T.mdevos
Cores of Cayley graphsSamal✭✭✭✭✭0Coloring » HomomorphismsRobert Samal
Consecutive non-orientable embedding obstructions✭✭✭0Topological G.T. » GenusBruce Richter
Complexity of the H-factor problem.Kühn; Osthus✭✭0Extremal G.T.fhavet
Complete bipartite subgraphs of perfect graphsFox✭✭0Basic G.T.mdevos
Colouring the square of a planar graphWegner✭✭0Coloring » Vertex coloringfhavet
Coloring the union of degenerate graphsTarsi✭✭0Coloringfhavet
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
Coloring random subgraphsBukh✭✭0Probabilistic G.T.mdevos
Coloring and immersionAbu-Khzam; Langston✭✭✭1Coloring » Vertex coloringmdevos
Circular flow numbers of $r$-graphsSteffen✭✭0Eckhard Steffen
Circular flow number of regular class 1 graphsSteffen✭✭0Coloring » Nowhere-zero flowsEckhard Steffen
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Coloring » Vertex coloringmdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Coloring » Vertex coloringmdevos
Circular choosability of planar graphsMohar0Coloring » Homomorphismsrosskang
Chromatic number of random lifts of complete graphsAmit✭✭0Probabilistic G.T.DOT
Chromatic Number of Common GraphsHatami; Hladký; Kráľ; Norine; Razborov✭✭0David Wood
Chords of longest cyclesThomassen✭✭✭0Basic G.T. » Cyclesmdevos
Choosability of Graph PowersNoel✭✭1Coloring » Vertex coloringJon Noel
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Coloring » Vertex coloringJon Noel
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0Infinite Graphsmdevos
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Directed Graphsfhavet
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Coloring » Vertex coloringJon Noel
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Coloring » Vertex coloringAndrew King
Bouchet's 6-flow conjectureBouchet✭✭✭0Coloring » Nowhere-zero flowsmdevos
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
Beneš Conjecture (graph-theoretic form)Beneš✭✭✭0Vadim Lioubimov
Barnette's ConjectureBarnette✭✭✭0Basic G.T. » CyclesRobert Samal
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Basic G.T.andreasruedinger
Are vertex minor closed classes chi-bounded?Geelen✭✭0Coloring » Vertex coloringmdevos
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Are almost all graphs determined by their spectrum?✭✭✭0mdevos
Arc-disjoint strongly connected spanning subdigraphsBang-Jensen; Yeo✭✭0fhavet
Syndicate content