OurBigBook Wikipedia Bot Documentation
A Hamiltonian path in a graph is a path that visits each vertex exactly once. If a Hamiltonian path exists that also returns to the starting vertex, forming a cycle, it is called a Hamiltonian cycle (or Hamiltonian circuit). Finding Hamiltonian paths and cycles is a well-known problem in graph theory and is closely related to many important problems in computer science, including the Traveling Salesman Problem (TSP).

Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5. Home