论文信息 - Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs

Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs

In 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamiltonian cycle. Combined with earlier results this would imply that every Hamiltonianr-regular graph (r?3) has a second Hamiltonian cycle. We shall verify this forr?300.

Carsten Thomassen | C. Thomassen

[1] Michael Stiebitz,et al. A solution to a colouring problem of P. Erdös , 1992, Discret. Math..

[2] Herbert Fleischner. Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs , 1994, J. Graph Theory.

[3] R. Graham,et al. Handbook of Combinatorics , 1995 .

[4] Roger C. Entringer,et al. Spanning cycles of nearly cubic graphs , 1980, J. Comb. Theory B.

[5] J. Spencer. Ramsey Theory , 1990 .

[6] C. C. Chen. On edge-Hamiltonian property of Cayley graphs , 1988, Discret. Math..

[7] Carsten Thomassen,et al. Chords of Longest Cycles in Cubic Graphs , 1997, J. Comb. Theory, Ser. B.

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

[9] W. T. Tutte. On Hamiltonian Circuits , 1946 .

[10] Carsten Thomassen,et al. On the Number of Hamiltonian Cycles in Bipartite Graphs , 1996, Combinatorics, Probability and Computing.