On the hamiltonian index of a graph (Q1313880)

Let \({\mathcal L}^ n({\mathcal G})\) be the \(n\)-th iterated line graph of a graph \(\mathcal G\). Let \(\mathcal G\) be a connected graph that is not a path. The hamiltonian index of \(\mathcal G\), shortly \(h(\mathcal G)\), is understood to be the smallest \(n\) such that \({\mathcal L}^ n(\mathcal G)\) is hamiltonian. The author presents a formula for \(h(\mathcal G)\) if all cyclic blocks of \(\mathcal G\) are hamiltonian.