The complexity of recognizing tough cubic graphs

Discrete Applied Mathematics

Volumn 79, Issue 1-3, 1997, Pages 35-44

  Bauer, D ^a   Van Den Heuvel, J ^b,e   Morgana, A ^c   Schmeichel, E ^d  

^a Stevens Institute of Technology   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d SAN JOSE STATE UNIVERSITY   (United States)

^e LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Cubic graphs; NP completeness; Toughness

Indexed keywords

EID: 30244525299     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00030-9     Document Type: Article

References (25)

1. T. Akiyama, T. Nishizeki, N. Saito, NP-completeness of the hamiltonian cycle problem for bipartite graphs, J. Inform. Proc. 3 (1980) 73-76.
2. T. Asano, N. Saito, G. Exoo, F. Harary, The smallest 2-connected cubic bipartite planar nonhamiltonian graph, Discrete Math. 38 (1982) 1-6.
3. D. Bauer, S.L. Hakimi, E. Schmeichel, Recognizing tough graphs is NP-hard, Discrete Appl. Math. 28 (1990) 191-195.
4. D. Bauer, A. Morgana, E. Schmeichel, On the complexity of recognizing tough graphs, Discrete Math. 124 (1994) 13-17.
5. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London, Elsevier, New York, 1976.
6. H.J. Broersma, J. van den Heuvel, H.J. Veldman, (Eds.), Updated contributions to the Twente Workshop on Hamiltonian Graph Theory, Technical Report, University of Twente, The Netherlands, 1992.
7. G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth, Belmont, CA, 1986.
8. V. Chvátal, Private communication.
9. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
10. V. Chvátal, Hamiltonian cycles, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, Ch. 11, Wiley, Chichester, 1985, pp. 403-429.
11. C.J. Colburn, L.K. Stewart, Dominating cycles in series-parallel graphs, Ars Combin. A19 (1985) 107-112.
12. M.B. Dillencourt, An upper bound on the shortness exponent of 1-tough maximal planar graphs, Discrete Math. 90 (1991) 93-97.
13. M.B. Dillencourt, On the toughness index of planar graphs, J. Graph Theory 18 (1994) 103-107.
14. G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2(3) (1952) 69-81.
15. H. Enomoto, B. Jackson, P. Katerinis, A. Saito, Toughness and the existence of k-factors, J. Graph Theory 9 (1985) 87-95.
16. M.R. Garey, D.S. Johnson, R.E. Tarjan, The planar Hamiltonian circuit property is NP-complete, SIAM J. Comput. 5 (1976) 705-714.
17. W.D. Goddard, H.C. Swart, On some extremal properties in connectivity, in: Graph Theory, Combinatorics, and Applications, Proc. 6th Quadrennial Internat. Conf. on the Theory and Applications of Graphs, Kalamazoo, Wiley, New York, 1991, pp. 535-551.
18. B. Jackson, P. Katerinis, A characterization of 3/2-tough cubic graphs, Ars Combin. 38 (1994) 145-148.
19. D. Kratsch, J. Lehel, H. Müller, Toughness, hamiltonicity and split graphs, Preprint, 1993.
20. 1, 3-free graphs, J. Graph Theory 8 (1984) 139-146.
21. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891) 193-220.
22. E.F. Schmeichel, G.S. Bloom, Connectivity, genus, and the number of components in vertex-deleted subgraphs, J. Combinat. Theory Ser. B 27 (1979) 198-201.
23. C. Thomassen, Long cycles in digraphs, Proc. London Math. Soc. vol. 42(3), 1981, pp. 231-251.
24. C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176.
25. W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116.