Regular homogeneously traceable nonhamiltonian graphs

From MaRDI portal
Publication:2074356



Abstract: A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer nge9, there exists a homogeneously traceable nonhamiltonian graph of order n. The graphs they constructed are irregular. Thus it is natural to consider the existence problem of regular homogeneously traceable nonhamiltonian graphs. We prove two results: (1) For every even integer nge10, there exists a cubic homogeneously traceable nonhamiltonian graph of order n; (2) for every integer pge18, there exists a 4-regular homogeneously traceable graph of order p and circumference p−4. Unsolved problems are posed.












This page was built for publication: Regular homogeneously traceable nonhamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074356)