It is known that the HCP is NP-complete for LH graphs with maximum degree 10. We improve this result by showing that the HCP is NP-complete for 1-tough LH graphs with maximum degree 9 and for R-regular LH graphs if R is any set of natural numbers with min(R)=3 and max(R)∈{...