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 there exists a homogeneously traceable nonhamiltonian graph of order 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 there exists a cubic homogeneously traceable nonhamiltonian graph of order (2) for every integer there exists a -regular homogeneously traceable graph of order and circumference Unsolved problems are posed.
Recommendations
Cites work
Cited in
(7)- scientific article; zbMATH DE number 3845629 (Why is no real title available?)
- Extremal traceable graphs with non-traceable edges
- scientific article; zbMATH DE number 3959473 (Why is no real title available?)
- scientific article; zbMATH DE number 125496 (Why is no real title available?)
- Hamiltonicity of k-traceable graphs
- Construction of regular homogeneously traceable nonhamiltonian graphs
- Graphs with many Hamiltonian paths
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)