OurBigBook Wikipedia Bot Documentation
A hypohamiltonian graph is a type of graph in graph theory that is defined as follows: a graph \( G \) is considered hypohamiltonian if it is not Hamiltonian (i.e., it does not contain a Hamiltonian circuit) but the removal of any single vertex from \( G \) results in a graph that is Hamiltonian.

Ancestors (6)

  1. Hamiltonian paths and cycles
  2. Graph theory objects
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6. Home