On regular homogeneously traceable nonhamiltonian graphs

Abstract

A graph is homogeneously traceable if each vertex is an endpoint of a Hamiltonian path. Chartrand, Gould, and Kapoor (1979) proved irregular homogeneously traceable nonhamiltonian graphs exist for every order $n\ge 9$. Hu and Zhan (DAM, 2022) considered the $3$-regular and $4$-regular cases and asked which order $n$ can be realized by a $k$-regular homogeneously traceable nonhamiltonian graph. Recently, Liu and Qiao (DAM, 2026) showed that $n=p(k-1)+q\ge 6(k-1)+q$ can be realized if $k\ge 5$ is odd and $q\in\{0,2,4,6\}$, or $k\ge 6$ is even and $q\in\{0,1,...,6\}$. In this paper, we show that for any $k\ge 6$ and $n\ge 6(k-2)$, there exists a $k$-regular homogeneously traceable nonhamiltonian graph of order $n$.