Hamiltonian path
Let be a graph. A path on that includes every vertex exactly once is called a Hamiltonian path
.
| Title | Hamiltonian path |
| Canonical name | HamiltonianPath |
| Date of creation | 2013-03-22 11:52:46 |
| Last modified on | 2013-03-22 11:52:46 |
| Owner | drini (3) |
| Last modified by | drini (3) |
| Numerical id | 10 |
| Author | drini (3) |
| Entry type | Definition |
| Classification | msc 05C45 |
| Classification | msc 46L05 |
| Classification | msc 82-00 |
| Classification | msc 83-00 |
| Classification | msc 81-00 |
| Related topic | HamiltonianCycle |
| Related topic | HamiltonianGraph |
| Related topic | PetersensGraph |
| Related topic | Traceable |