---
tag: 0HF30P75G4
kind: concept
name: Hamiltonian cycle
msc: [05C45]
sources:
  - url: https://en.wikipedia.org/wiki/Hamiltonian_path
    locator: Definitions
---

## Summary

A Hamiltonian cycle is a cycle that passes through every vertex of a graph. The search for such cycles is a classical hard problem, related to the travelling salesman problem. The node [[Hamiltonian cycle|0HKXNG2RS1]] gives the precise definition.