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

D. Bauer, Haitze J. Broersma, A. Morgana, E. Schmeichel

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
65 Downloads (Pure)


An example of such a theorem is the well-known Chvátal–Erdős Theorem, which states that every graph G with ακ is hamiltonian. Here κ is the vertex connectivity of G and α is the cardinality of a largest set of independent vertices of G. In another paper Chvátal points out that the proof of this result is in fact a polynomial time construction that either produces a Hamilton cycle or a set of more than κ independent vertices. In this note we point out that other theorems in hamiltonian graph theory have a similar character. In particular, we present a constructive proof of a well-known theorem of Jung (Ann. Discrete Math. 3 (1978) 129) for graphs on 16 or more vertices.
Original languageEnglish
Pages (from-to)13-23
Number of pages11
JournalDiscrete applied mathematics
Issue number1-3
Publication statusPublished - 2002


  • NP-hardness
  • Hamiltonian graphs
  • Toughness
  • Constructive proofs
  • Complexity
  • Polynomial algorithms


Dive into the research topics of 'Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion'. Together they form a unique fingerprint.

Cite this