More Progress on Tough Graphs - The Y2K Report

Electronic Notes in Discrete Mathematics

Volumn 11, Issue , 2002, Pages 63-80

  Bauer, Doug ^a   Broersma, Hajo ^b   Schmeichel, Edward ^c  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

chordal graph; circumference; complexity; factor; Hamilton cycle; hamiltonian graph; t tough graph; toughness; traceable graph

Indexed keywords

EID: 33847293468     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00055-1     Document Type: Article

References (61)

1. Balakrishnan R., and Paulraja P. Chordal graphs and some of their derived graphs. Congr. Numer 53 (1986) 71-74
2. Bauer D., Broersma H.J., Morgana A., and Schmeichel E. Polynomial algorithms that prove an NP-hard hypothesis implies and NP-hard conclusion. Preprint (2000)
3. Bauer D., Broersma H.J., van den Heuvel J., and Veldman H.J. On hamiltonian properties of 2-tough graphs. J. Graph Theory 18 (1994) 539-543
4. Bauer D., Broersma H.J., and Veldman H.J. Not every 2-tough graph is hamiltonian. Discrete Appl. Math 99 (2000) 317-321
5. Bauer D., Hakimi S.L., and Schmeichel E. Recognizing tough graphs is NP-hard. Discrete Appl. Math 28 (1990) 191-195
6. Bauer D., Katona G.Y., Kratsch D., and Veldman H.J. Chordality and 2-factors in tough graphs. Discrete Appl. Math 99 (2000) 323-329
7. Bauer D., Morgana A., Schmeichel E., and Veldman H.J. Long cycles in graphs with large degree sums. Discrete Math 79 (1989/90) 59-70
8. Bauer D., Niessen T., and Schmeichel E. Toughness, minimum degree and spanning cubic subgraphs. Preprint (2000)
9. Bauer D., and Schmeichel E. Toughness minimum degree and the existence of 2-factors. J. Graph Theory 18 (1994) 241-256
10. Bauer D., Schmeichel E., and Veldman H.J. Some recent results on long cycles in tough graphs. In: Alavi Y., Chartrand G., Oellermann O.R., and Schwenk A.J. (Eds). Graph Theory, Combinatorics, and Applications - Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs (1991), John Wiley & Sons, Inc, New York 113-121
11. Bauer D., Schmeichel E., and Veldman H.J. Cycles in tough graphs - updating the last four years. In: Alavi Y., and Schwenk A.J. (Eds). Graph Theory, Combinatorics, and Applications - Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs (1995), John Wiley & Sons, Inc, New York 19-34
12. Bauer D., Schmeichel E., and Veldman H.J. Progress on tough graphs - another four years. In: Alavi Y., Lick D.R., and Schwenk A. (Eds). The Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications (1999), John Wiley & Sons, Inc, New York 69-88
13. Bauer D., van den Heuvel J., Morgana A., and Schmeichel E. The complexity of recognizing tough cubic graphs. Discrete Appl. Math 79 (1997) 35-44
14. Bauer D., van den Heuvel J., Morgana A., and Schmeichel E. The complexity of toughness in regular graphs. Congr. Numer 130 (1998) 47-61
15. Böhme T., Harant J., and Tkáč M. More than 1-tough chordal planar graphs are hamiltonian. J. Graph Theory 32 (1999) 405-410
16. A. Brandstädt, V.B. Le, and J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, PA, 1999).
17. Broersma H.J., Engbers E., and Trommel H. Various results on the toughness of graphs. NETWORKS 33 (1999) 233-238
18. Cai M., Favaron O., and Li H. (2,k)-factor-critical graphs and toughness. Graphs and Combin 15 (1999) 137-142
19. Chartrand G., and Lesniak L. Graphs and Digraphs (1996), Chapman and Hall, London
20. Chen G., Jacobson M.S., Kézdy A.E., and Lehel J. Tough enough chordal graphs are hamiltonian. NETWORKS 31 (1998) 29-38
21. V. Chvátal, Private communication.
22. Chvátal V. Tough graphs and hamiltonian circuits. Discrete Math 5 (1973) 215-228
23. Chvátal V. Hamiltonian cycles. In: Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys B. (Eds). The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization (1985), John Wiley & Sons, Chichester 403-429
24. Chvátal V., and Erdös P. A note on hamiltonian circuits. Discrete Math 2 (1972) 111-113
25. Colbourn C.J., and Stewart L.K. Dominating cycles in series-parallel graphs. Ars Combinatoria 19a (1985) 107-112
26. Cunningham W.H. On submodular function minimization. Combinatorica 5 (1985) 185-192
27. Deogun J.S., Kratsch D., and Steiner G. 1-Tough cocomparability graphs are hamiltonian. Discrete Math 170 (1997) 99-106
28. Dillencourt M.B. An upper bound on the shortness exponent of 1-tough maximal planar graphs. Discrete Math 90 (1991) 93-97
29. Ellingham M.N., and Zha X. Toughness, trees and k-walks. J. Graph Theory 33 (2000) 125-137
30. Enomoto H. Toughness and the existence of k-factors II. Graphs and Combin 2 (1986) 37-42
31. Enomoto H. Toughness and the existence of k-factors III. Discrete Math 189 (1998) 277-282
32. Enomoto H., Jackson B., Katerinis P., and Saito A. Toughness and the existence of k-factors. J. Graph Theory 9 (1985) 87-95
33. R. Faudree, R. Gould, M. Jacobson, L. Lesniak, and A. Saito, Private communication.
34. Favaron O. On k-factor-critical graphs. Discussiones Mathematicae - Graph Theory 16 (1996) 41-51
35. K. Ferland, Toughness of generalized Petersen graphs, Preprint.
36. Ferland K. On the toughness of some generalized Petersen graphs. Ars Combinatoria 36 (1993) 65-88
37. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco, CA
38. Goddard W., Plummer M.D., and Swart H. Maximum and minimum toughness of graphs of small genus. Discrete Math 167/168 (1997) 329-339
39. Goddard W., and Swart H. On some extremal problems in connectivity. In: Alavi Y., Chartrand G., Oellermann O.R., and Schwenk A.J. (Eds). Graph Theory, Combinatorics, and Applications - Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs (1991), John Wiley & Sons, Inc, New York 535-551
40. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer, Berlin
41. Grünbaum B., and Walther H. Shortness exponents of families of graphs. J. Combinat. Theory - Ser. B 14 (1973) 364-385
42. Jackson B., and Katerinis P. A characterization of 3/2-tough cubic graphs. Ars Combinatoria 38 (1994) 145-148
43. Jung H.A. On maximal circuits in finite graphs. Ann. Discrete Math 3 (1987) 129-144
44. Katona G.Y. Toughness and edge-toughness. Discrete Math 164 (1997) 187-196
45. Katona G.Y. Properties of edge-tough graphs. Graphs and Combin 15 (1999) 315-325
46. Kiel J.M. Finding Hamiltonian circuits in interval graphs. Inf. Process. Lett 20 (1985) 201-206
47. D. Kratsch, Private communication.
48. Kratsch D., Lehel J., and Müller H. Toughness hamiltonicity and split graphs. Discrete Math 150 (1996) 231-245
49. Li J. Cycles through many vertices of given subsets in 1-tough graphs. J. China Univ. Sci. Tech 27 (1997) 355-361
50. Li J. Cycles containing many vertices of subsets in 1-tough graphs with large degree sums. Ars Combin 48 (1998) 195-212
51. Liu G., and Yu Q. k-factors and extendability with prescribed components. Preprint (2000)
52. 1,3-free graphs. J. Graph Theory 1 (1984) 139-146
53. Nishizeki T. A 1-tough non hamiltonian maximal planar graph. Discrete Math 30 (1980) 305-307
54. Piazza B., Ringeisen R., and Stueckle S. On the vulnerability of cycle permutation graphs. Ars Combinatoria 29 (1990) 289-296
55. Plummer M.D. A note on toughness and tough components. Congr. Numer 125 (1997) 179-192
56. Schmeichel E.F., and Bloom G.S. Connectivity, genus and the number of components in vertex-deleted subgraphs. J. Combinat. Theory - Ser. B 27 (1979) 198-201
57. Shi M., Yuan X., Cai M., and Favaron O. (3,k)-factor-critical graphs and toughness. Graphs and Combin 15 (1999) 463-471
58. Thomassen C. Long cycles in digraphs. Proc. London Math. Soc 42 (1981) 231-251
59. Tkáč M. On the shortness exponent of 1-tough maximal planar graphs. Discrete Math 154 (1996) 321-328
60. Watkins M.E. A theorem on Tait colorings with an application to the generalized Petersen graphs. J. Combin. Theory 6 (1969) 152-164
61. Woeginger G.J. The toughness of split graphs. Discrete Math 190 (1998) 295-297