Tough enough chordal graphs are Hamiltonian

Networks

Volumn 31, Issue 1, 1998, Pages 29-38

  Chen, Guantao ^a   Jacobson, Michael S ^b   Kézdy, André E ^b   Lehel, Jenö ^b  

^a GEORGIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF LOUISVILLE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039991998     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199801)31:1<29::AID-NET4>3.0.CO;2-M     Document Type: Article

References (11)

1. R. Balakrishnan and P. Paulraja, Chordal graphs and some of their derived graphs. Congress. Num. 53 (1986) 71-74.
2. D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2-tough graph is Hamiltonian. Unpublished (1997).
3. V. Chvátal, Tough graphs and Hamiltonian circuits. Discr. Math. 5 (1973) 215-228.
4. J. S. Deogun and G. Steiner, Polynomial algorithms for Hamiltonian cycle in cocomparability graphs. SIAM J. Comput. 23 (1994) 520-552.
5. G. A. Dirac, On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25 (1961) 71-76.
6. P. C. Gilmore and A. J. Hoffman, A characterization of comparability graphs and of interval graphs. Can. J. Math. 16 (1964) 539-548.
7. P. R. Halmos and H. E. Vaughan, The marriage problem. Am. J. Math. 72 (1950) 214-215.
8. J. M. Keil, Finding Hamiltonian circuits in interval graphs. Inf. Process. Lett. 20 (1985) 201-206.
9. D. Kratsch, Personal communication.
10. D. Kratsch, J. Lehel, and H. Müller, Toughness, Hamiltonicity, and split graphs. Discr. Math. 150 (1-3) (1996) 231-245.
11. 1.3-free graphs. J. Graph Theory 8 (1984) 139-146.