A sequence of Vertices and Edges such that the Vertices and Edges are adjacent. A walk is therefore equivalent to a graph Cycle, but with the Vertices along the walk enumerated as well as the Edges.