Graphs with no $2\delta + 1$ cycle
Galen E. Turner III · arXiv (Cornell University) · 2003
Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.