Small cycles in Hamiltonian graphs Original Research Article

We 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).