Hamilton path vs. Euler path

Hamiltonian path means the path visits every *vertex* of the graph exactly once.
Euler path means the path visits every *edge* of the graph exactly once.

The above definitions become "circle" (or circuit) if you require that at the end you return to the starting vertex (edge).