Graph Theory

TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Coloring » Vertex coloringJon Noel
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Extremal G.T.shudeshijie
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournamentYuster✭✭0fhavet
Woodall's ConjectureWoodall✭✭✭0Directed Graphsmdevos
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Real roots of the flow polynomialWelsh✭✭0Coloring » Nowhere-zero flowsmdevos
Colouring the square of a planar graphWegner✭✭0Coloring » Vertex coloringfhavet
Triangle-packing vs triangle edge-transversal.Tuza✭✭0Extremal G.T.fhavet
5-flow conjectureTutte✭✭✭✭0Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Topological G.T. » Crossing numbersRobert Samal
Turán's problem for hypergraphsTuran✭✭0Hypergraphsfhavet
Hamiltonian cycles in line graphsThomassen✭✭✭0Basic G.T. » CyclesRobert Samal
Chords of longest cyclesThomassen✭✭✭0Basic G.T. » Cyclesmdevos
Counting 3-colorings of the hex latticeThomassen✭✭0Coloring » Vertex coloringmdevos
Arc-disjoint out-branching and in-branchingThomassen✭✭0Directed Graphsfhavet
Subgraph of large average degree and large girth.Thomassen✭✭0Basic G.T.fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.Thomassen✭✭0Directed Graphs » Tournamentsfhavet
Partitionning a tournament into k-strongly connected subtournaments.Thomassen✭✭0Directed Graphs » Tournamentsfhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Directed Graphsfhavet
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Coloring the union of degenerate graphsTarsi✭✭0Coloringfhavet
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Circular flow number of regular class 1 graphsSteffen✭✭0Coloring » Nowhere-zero flowsEckhard Steffen
Circular flow numbers of $r$-graphsSteffen✭✭0Eckhard Steffen
Does the chromatic symmetric function distinguish between trees?Stanley✭✭0Algebraic G.T.mdevos
Switching reconstruction conjectureStanley✭✭0fhavet
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Basic G.T. » Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Basic G.T. » Cyclesmdevos
Seymour's self-minor conjectureSeymour✭✭✭0Infinite Graphsmdevos
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
Seagull problemSeymour✭✭✭0Basic G.T. » Minorsmdevos
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Directed Graphs » Tournamentsmdevos
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Directed Graphsfhavet
Cores of Cayley graphsSamal✭✭✭✭✭0Coloring » HomomorphismsRobert Samal
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.Sabidussi✭✭0Basic G.T. » Cyclesfhavet
Ryser's conjectureRyser✭✭✭0Hypergraphsmdevos
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Basic G.T. » MatchingsJirka
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Basic G.T.andreasruedinger
A generalization of Vizing's Theorem?Rosenfeld✭✭0Coloring » Edge coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Algorithmsmdevos
Earth-Moon ProblemRingel✭✭1Coloring » Vertex coloringfhavet
Forcing a 2-regular minorReed; Wood✭✭1Basic G.T. » MinorsDavid Wood
Reed's omega, delta, and chi conjectureReed✭✭✭0Coloring » Vertex coloringmdevos
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
Syndicate content