On the regular 2-connected 2-path Hamiltonian graphs

Xia Li, Weihua Yang

A graph $G$ is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. It is well known that a 2-connected, $k$-regular graph $G$ on at…