Not every 2-tough graph is Hamiltonian

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 317-321

  Bauer, D ^a   Broersma, H J ^b   Veldman, H J ^b  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

05C35; 05C38; 05C45; 2 tough graph; Chordal graph; Hamiltonian graph; Toughness; Traceable graph

Indexed keywords

EID: 0038621285     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00141-9     Document Type: Article

References (9)

1. Bauer D., Broersma H.J., van den Heuvel J., Veldman H.J. On Hamiltonian properties of 2-tough graphs. J. Graph Theory. 18:1994;539-543.
2. D. Bauer, G.Y. Katona, D. Kratsch, H.J. Veldman, Chordality and 2 -factors in tough graphs, Discrete Appl. Math., this volume.
3. Bauer D., Schmeichel E. Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory. 18:1994;241-256.
4. J.C. Bermond, Hamiltonian graphs, in: L. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Academic Press, London, 1978, pp. 127-167.
5. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London, Elsevier, New York, 1976.
6. Chen G., Jacobson M.S., Kézdy A., Lehel J. Tough enough chordal graphs are Hamiltonian. Networks. 31:1998;29-38.
7. Chvátal V. Tough graphs and Hamiltonian circuits. Discrete Math. 5:1973;215-228.
8. Enomoto H., Jackson B., Katerinis P., Saito A. Toughness and the existence of. k -factors J. Graph Theory. 9:1985;87-95.
9. D. Kratsch, personal communication.