Independent dominating sets and a second Hamiltonian cycle in regular graphs

Journal of Combinatorial Theory. Series B

Volumn 72, Issue 1, 1998, Pages 104-109

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013464946     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1997.1794     Document Type: Article

References (12)

1. J. A. Bondy, Basic graph theory, in "Handbook of Combinatorics" (M. Grötschel, L. Lovász, R. L. Graham, Eds.), pp. 3-110, Amsterdam, North-Holland, 1995.
2. C. C. Chen, On edge-hamiltonian property of Cayley graphs, Discrete Math. 72 (1988), 29-33.
3. R. C. Entringer and H. Swart, Spanning cycles of nearly cubic graphs, J. Combin. Theory Ser. B 29 (1980), 303-309.
4. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Colloq. Math. Soc. János Bolyai 10 (1973), 609-627.
5. H. Fleischner, Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs, J. Graph Theory 18 (1994), 449-459.
6. H. Fleischner and M. Stiebitz, A solution to a colouring problem, Discrete Math. 101 (1992), 39-48.
7. R. L. Graham, B. L. Rotschild, and J. H. Spencer, "Ramsey Theory," Wiley, New York, 1980.
8. J. Sheehan, The multiplicity of Hamiltonian circuits in a graph , in "Recent Advances in Graph Theory" (M. Fiedler, Eds.), pp. 447-480, Academia, Prague, 1975.
9. A. G. Thomason, Hamiltonian cycles and uniquely edge colourable graphs, Ann. Discrete Math. 3 (1978), 259-268.
10. C. Thomassen, On the number of Hamiltonian cycles in bipartite graphs, Combin. Probab. and Comput. 5 (1996), 437-442.
11. C. Thomassen, Chords of longest cycles in cubic graphs, J. Combin. Theory Ser. B 71 (1997), 211-214.
12. W. T. Tutte, On Hamiltonian circuits, J. London Math. Soc. 21 (1946), 98-101.