Deleting vertices from a Hamilton cycle leaves at most path components, so the property is necessary. It is not sufficient: the Petersen graph is 1-tough, meaning for every separating set , but it is not Hamiltonian.

Ancestors (11)

  1. b
  2. 17J
  3. Paper 4
  4. ii
  5. 2026
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version