Home » Subject » Graph Theory

Basic Graph Theory


TitleAuthor(s)Imp.¹Rec.²Subtopicsort iconPosted by
Graham's conjecture on tree reconstructionGraham✭✭0mdevos
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0mdevos
Complete bipartite subgraphs of perfect graphsFox✭✭0mdevos
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0andreasruedinger
Domination in cubic graphsReed✭✭0mdevos
Friendly partitionsDeVos✭✭0mdevos
Subgraph of large average degree and large girth.Thomassen✭✭0fhavet
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1mhaythorpe
Partitioning edge-connectivityDeVos✭✭0Connectivitymdevos
Kriesell's ConjectureKriesell✭✭0ConnectivityJon Noel
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Cyclesmdevos
The circular embedding conjectureHaggard✭✭✭0Cyclesmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Cyclesmdevos
Decomposing eulerian graphs✭✭✭0Cyclesmdevos
Barnette's ConjectureBarnette✭✭✭0CyclesRobert Samal
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0CyclesRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0CyclesRobert Samal
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1CyclesAgelos
Jones' conjectureKloks; Lee; Liu✭✭0Cyclescmlee
Chords of longest cyclesThomassen✭✭✭0Cyclesmdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Cyclestchow
Strong 5-cycle double cover conjectureArthur; Hoffmann-Ostenhof✭✭✭1Cyclesarthur
Decomposing an eulerian graph into cycles.Hajós✭✭0Cyclesfhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.Sabidussi✭✭0Cyclesfhavet
Every prism over a 3-connected planar graph is hamiltonian.Kaiser; Král; Rosenfeld; Ryjácek; Voss✭✭0Cyclesfhavet
4-connected graphs are not uniquely hamiltonianFleischner✭✭0Cyclesfhavet
Hamilton decomposition of prisms over 3-connected cubic planar graphsAlspach; Rosenfeld✭✭0Cyclesfhavet
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Matchingsmdevos
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Matchingsmdevos
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1MatchingsJirka
Random stable roommatesMertens✭✭0Matchingsmdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Minorsmdevos
Seagull problemSeymour✭✭✭0Minorsmdevos
Forcing a $K_6$-minorBarát ; Joret; Wood✭✭0MinorsDavid Wood
Forcing a 2-regular minorReed; Wood✭✭1MinorsDavid Wood
Decomposing a connected graph into paths.Gallai✭✭✭0Pathsfhavet
Partition of a cubic 3-connected graphs into paths of length 2.Kelmans✭✭0Pathsfhavet

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content