A strengthening of Kikustapos;s theorem
George R. T. Hendry · Journal of Graph Theory · 1989
Abstract We consider connected, locally connected graphs in which the maximum and minimum degrees differ by at most one and do not exceed five. It is shown that if C is a nonhamiltonian cycle in such a graph G, then there exists a cycle Capos; in G such that V(C) ⊆ V(Capos;) and /V(Capos;) = /(C) + 1.