A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs

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.

Bibliographic Details
Main Author: Byoung-Song Chwe
Format: Article
Language:English
Published: Wiley 1994-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S0161171294000736