Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

Discrete Applied Mathematics

Volumn 120, Issue 1-3, 2002, Pages 13-23

  Bauer, D ^a   Broersma, H J ^b   Morgana, A ^c   Schmeichel, E ^d  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Complexity; Constructive proofs; Hamiltonian graphs; NP hardness; Polynomial algorithms; Toughness

Indexed keywords

EID: 84867938838     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00276-1     Document Type: Article

References (13)

1. D. Bauer, S.L. Hakimi, and E. Schmeichel Recognizing tough graphs is NP-hard Discrete Appl. Math. 28 1990 191 195
2. D. Bauer, A. Morgana, and E. Schmeichel A simple proof of a theorem of Jung Discrete Math. 79 1989/90 147 152
3. D. Bauer, A. Morgana, and E. Schmeichel On the complexity of recognizing tough graphs Discrete Math. 124 1994 13 17
4. D. Bauer, A. Morgana, E. Schmeichel, and H.J. Veldman Long cycles in graphs with large degree sums Discrete Math. 79 1989/90 59 70
5. G. Chartrand, and L. Lesniak Graphs and Digraphs 1996 Chapman & Hall London
6. V. Chvátal, Hamiltonian cycles, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, B. Shmoys (Eds.), The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985, pp. 403-429 (Chapter 11).
7. V. Chvátal, and P. Erdos A note on hamiltonian circuits Discrete Math. 2 1972 111 113
8. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 Freeman San Francisco, CA
9. R. Häggkvist On the structure of non-hamiltonian graphs I Combin. Probab. Comput. 1 1992 27 34
10. I. Holyer The NP-completeness of edge coloring SIAM J. Comput. 10 1981 718 720
11. T.R. Jensen, and B. Toft Graph Coloring Problems 1995 Wiley New York
12. H.A. Jung On maximal circuits in finite graphs Ann. Discrete Math. 3 1978 129 144
13. I. Schiermeyer, P. Mihok, Chromatic number of classes of graphs with prescribed cycle lengths, Preprint, 1997.