Paths

Hamilton Path - An arc which visits every vertex, exactly once - although it can return to its starting vertex and immediately stop there.
Hamilton Circuit - If it does return to it's starting vertex, it's a Hamilton Circuit.
Euler Path - aka Covering Path, this path touches every edge on the graph.
Euler Cycle - If the Euler path ends where it started. For connected graphs, only if every vertex is even.