A trail (no repeated edges) that follows every edge. Existence An Eulerian trail will exist if and only if the graph: is connected has exactly zero or two nodes that have an odd degree if there are zero nodes with odd degree, the Eulerian trail can start at any node in the graph. if there are two nodes with odd degree, the Eulerian trail will start at one of the odd degree nodes, and finish at the other.