A **Hamiltonian Path** in a graph

A **Hamiltonian path** that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian Circuit.

A **Hamiltonian Path** in a graph

A **Hamiltonian path** that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian Circuit.