Topics
Hamiltonian Paths
A Hamiltonian path is a path which visits every vertex once, with no repetition of vertices.
Note that a Hamiltonian path does not require every edge to be visited. However, no edge can be repeated without repeating a vertex and so no edge is repeated either.
Hamiltonian Paths
A Hamiltonian path is a path which visits every vertex once, with no repetition of vertices.
Note that a Hamiltonian path does not require every edge to be visited. However, no edge can be repeated without repeating a vertex and so no edge is repeated either.