Various results on the toughness of graphs

Networks

Volumn 33, Issue 3, 1999, Pages 233-238

  Broersma, Hajo ^a   Engbers, Erik ^a,b   Trommel, Huib ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Degree sum condition; Minimally t tough graph; Square of a graph; T tough graph; Toughness (of subgraphs)

Indexed keywords

EID: 0033130344     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199905)33:3<233::AID-NET9>3.0.CO;2-A     Document Type: Article

References (14)

1. [1] D. Bauer, H.J. Broersma, J. van den Heuvel, and H.J. Veldman, On Hamiltonian properties of 2-tough graphs, J Graph Theory 18 (1994), 539-543.
2. [2] D. Bauer, H.J. Broersma, and H.J. Veldman, Not every 2-tough graph is Hamiltonian, Discr Appl Math, to appear.
3. [3] D. Bauer, A. Morgana, and E. Schmeichel, On the complexity of recognizing tough graphs, Discr Math 124 (1994), 13-17.
4. [4] J.A. Bondy and U.S.R. Murty, Graph theory with applications, MacMillan/Elsevier, London/New York, 1976.
5. [5] A.E. Brouwer, Personal communication, 1998.
6. [6] A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance-regular graphs, Springer-Verlag, Berlin, Heidelberg, 1989.
7. [7] G. Chartrand, A.M. Hobbs, and H.A. Jung, The square of a block is Hamiltonian connected, J Combin Theory B 16 (1974), 290-292.
8. [8] V. Chvátal, Tough graphs and Hamiltonian circuits, Discr Math 5 (1973), 215-228.
9. [9] V. Chvátal and P. Erdös, A note on Hamiltonian circuits, Discr Math 2 (1972), 111-113.
10. [10] H. Enomoto, B. Jackson, P. Katerinis, and A. Saito, Toughness and the existence of k-factors, J Graph Theory 9 (1985), 87-95.
11. [11] H. Fleischner, The square of every 2-connected graph is Hamiltonian, J Combin Theory B 16 (1974), 29-34.
12. [12] M.R. Garey and D.S. Johnson, Computers and intractability, W.H. Freeman, New York, 1979.
13. [13] J. van den Heuvel, Personal communication, 1995. Also in EIDMA workshop on Hamiltonicity of 2-tough graphs: Progress report, J.A. Bondy, H.J. Broersma, C. Hoede, and H.J. Veldman (Editors), Networks, to appear.
14. [14] O. Ore, Note on Hamiltonian circuits, Am Math Monthly 67 (1960), 55.