Abstract
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when the number of arcs is at least twice the number of vertices of a digraph.
Open Access
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
Received30 Dec 1992
Revised18 Oct 1993
Copyright
Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.