ABSTRACT
A cycle containing all vertices of a graph is referred to as a Hamilton cycle.
An Eulerian trail is a trail contmning all vertices of a griq>h; such a trail can be open or closed when G contains two or no vertices of odd degree, respectively. For graphs with more than two vertices of odd degree no Eulerian trml exists.
