论文信息 - On Hamiltonian-connected regular graphs

On Hamiltonian-connected regular graphs

In this paper it is shown that any m-regular graph of order 2m (m ≧ 3), not isomorphic to Km,m, or of order 2m + 1 (m even, m ≧ 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains atleast m Hamiltonian cycles for odd m and atleast 1/2m Hamiltonian cycles for even m.

Ioan Tomescu | I. Tomescu

[1] Harold Davenport. On the Minimum of a Ternary Cubic Form , 1944 .

[2] A. Thomason. Hamiltonian Cycles and Uniquely Edge Colourable Graphs , 1978 .

[3] Bill Jackson,et al. Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree , 1979 .

[4] C. Nash-Williams,et al. Hamiltonian arcs and circuits , 1971 .

[5] Bill Jackson. Hamilton cycles in regular 2-connected graphs , 1980, J. Comb. Theory, Ser. B.