We investigate the set of cycle lengths occurring in a hamiltonian graph with at least one or two vertices of large degree. We prove that in every case this set contains all the integers between 3 and some t, where t depends on the order of the graph and the degrees of vertices.
['Mekkia Kouider', 'Antoni Marczyk']
On pancyclism in hamiltonian graphs