Graph Theory


TitleAuthor(s)sort iconImp.¹Rec.²Topic » SubtopicPosted by
Does the chromatic symmetric function distinguish between trees?Stanley✭✭0Algebraic G.T.mdevos
Switching reconstruction conjectureStanley✭✭0fhavet
Circular flow number of regular class 1 graphsSteffen✭✭0Coloring » Nowhere-zero flowsEckhard Steffen
Circular flow numbers of $r$-graphsSteffen✭✭0Eckhard Steffen
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Coloring the union of degenerate graphsTarsi✭✭0Coloringfhavet
Highly connected graphs with no K_n minorThomas✭✭✭0Basic G.T. » Minorsmdevos
Directed path of length twice the minimum outdegreeThomassé✭✭✭0Directed Graphsfhavet
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
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Topological G.T. » Crossing numbersRobert Samal
Turán's problem for hypergraphsTuran✭✭0Hypergraphsfhavet
5-flow conjectureTutte✭✭✭✭0Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Coloring » Nowhere-zero flowsmdevos
Triangle-packing vs triangle edge-transversal.Tuza✭✭0Extremal G.T.fhavet
Colouring the square of a planar graphWegner✭✭0Coloring » Vertex coloringfhavet
Real roots of the flow polynomialWelsh✭✭0Coloring » Nowhere-zero flowsmdevos
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Woodall's ConjectureWoodall✭✭✭0Directed Graphsmdevos
Minimum number of arc-disjoint transitive subtournaments of order 3 in a tournamentYuster✭✭0fhavet
Extremal problem on the number of tree endomorphismZhicong Lin✭✭1Extremal G.T.shudeshijie
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Coloring » Vertex coloringJon Noel
Syndicate content