Discrete Applied MathematicsVolume 79, Issues 1–3, 27 November 1997, Pages 201-211Small cycles in Hamiltonian graphsAuthor links open overlay panelUwe Schelten a, Ingo Schiermeyer bShow moreShareCitehttps://doi.org/10.1016/S0166-218X(97)00043-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe prove that if a graph G on n ⩾ 32 vertices is hamiltonian and has two nonadjacent vertices u and v with d(u) + d(v) ⩾ n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 ⩽ m ⩽ 15(n + 13).Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1997 Published by Elsevier B.V.