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

Byoung-Song Chwe

International Journal of Mathematics and Mathematical Sciences, 1994, vol. 17, 1-6

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.

Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/17/874595.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/17/874595.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:874595

DOI: 10.1155/S0161171294000736

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().