On the Hamiltonian index (Q1099188): Difference between revisions

The author defines h(G) as the smallest number m such that the m times iterated line graph has a Hamiltonian cycle and \(\ell (G)\) as the largest number k such that G has a path of length k which is not part of a \(K_ 3\) and whose internal vertices all have degree 2 in G. Theorem: h(G)\(\leq \ell (G)+1\) for every connected graph G which is not a path.