Journal Menu

Abstracting and Indexing
Aims and Scope
Article Processing Charges
Author Guidelines
Bibliographic Information
Contact Information
Editorial Board
Editorial Workflow
Reviewers Acknowledgment
Subscription Information

Abstract
Full-Text PDF

International Journal of Mathematics and Mathematical Sciences
Volume 17 (1994), Issue 3, Pages 497-502
doi:10.1155/S0161171294000736

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

Byoung-Song Chwe

Department of Mathematics, University of Alabama, Tuscaloosa 35486, Alabama, USA

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.