A Walk on the Edges of a Graph which uses each Edge exactly once. A Connected Graph has an Eulerian trail Iff it has at most two Vertices of Odd Degree.