Finite or infinite sequence of edges which joins a sequence of vertexes
Closed walk → walk in which first = last vertex
walk in which all edges are distinct (but not necessarily all vertexes)
trail in which all vertexes (and therefore also all edges) are distinct
closed walk in $G$ that includes/traverses every edge at least once
non-empty trail in which the first and last vertexes are equal (but all other vertexes are distinct)
trail in a finite graph that includes/traverses every edge exactly once (but allows for revisiting vertexes)
eularian trail that starts and ends at the same vertex
path in a graph that visits each vertex exactly once
hamiltonian path in which the first and last vertex are equal