The longest cycle of a graph with a large minimal degree
From MaRDI portal
Publication:3720635
DOI10.1002/jgt.3190100115zbMath0592.05042MaRDI QIDQ3720635
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100115
05C38: Paths and cycles
Related Items
Tight cycles and regular slices in dense hypergraphs, Graph invariants and large cycles: a survey, Cycles through specified vertices, Trees through specified vertices, The longest cycles in a graph G with minimum degree at least \(| G| /k\), Cycle lengths and minimum degree of graphs, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Stability for vertex cycle covers