This thesis treats the problem of enumerating equivalence
classes of Euler paths of full graphs. A full graph
is a complete, unordered, graph with no loops or repeated
edges. Two Euler paths are equivalent if and only if one
can be transformed into the other by a finite sequence of...