Definition
•
A graph is said to be
traceable
(or has a
Hamiltonian Path) if the all of the vertices
of the graph can be visited exactly once.
A traceable graph
Not a traceable graph