# traceable

Let $G$ be a graph. If $G$ has a Hamiltonian path, we say that $G$ is traceable.

Not every traceable graph is Hamiltonian. As an example consider Petersen’s graph.

 Title traceable Canonical name Traceable Date of creation 2013-03-22 11:52:52 Last modified on 2013-03-22 11:52:52 Owner drini (3) Last modified by drini (3) Numerical id 9 Author drini (3) Entry type Definition Classification msc 05C45 Classification msc 03B22 Classification msc 03-00 Classification msc 03-01 Related topic HamiltonianPath Related topic HamiltonianCycle Related topic HamiltonianGraph Related topic PetersensGraph