Hamiltonian cycle
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 gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Hamiltonian_path, Definitions
About this page
| Tag | 0HF30P75G4 |
|---|---|
| URI | m2://0HF30P75G4 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C45 |
| Specializes | Cycle |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.