Eulerian Directed Multigraphs

Donald Silberger

For $\Delta$ a finite connected nontrivial directed multigraph, we prove: 1. $\Delta$ has a directed circuit using each directed edge exactly once if and only if both each pair of distinct v…