Toughness, trees, and walks

Journal of Graph Theory

Volumn 33, Issue 3, 2000, Pages 125-137

  Ellingham, M N ^a   Zha, Xiaoya ^b  

^a VANDERBILT UNIVERSITY   (United States)

^b MIDDLE TENNESSEE STATE UNIVERSITY   (United States)

Author keywords

Spanning tree; Spanning walk; Toughness

Indexed keywords

EID: 0034387250     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X     Document Type: Article

References (6)

1. D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2-tough graph is hamiltonian, preprint (1997).
2. J.-C. Bermond, "Hamiltonian graphs," Selected topics in graph theory, L. W. Beineke and R. J. Wilson (Editors), Academic Press, London, 1978, pp. 127-167.
3. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math 5 (1973), 215-228.
4. H. Enomoto, B. Jackson, P. Katerinis, and A. Saito, Toughness and the existence of k-factors, J Graph Theory 9 (1985), 87-95.
5. B. Jackson and N. C. Wormald, k-walks of graphs, Australas J Combin 2 (1990), 135-146.
6. S. Win, On a connection between the existence of k-trees and the toughness of a graph, Graphs Combin 5 (1989), 201-205.