UA cloudflare authentication

 

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

Thumbnail Image

Files

International Journal of Mathematics and Mathematical Sciences - 1993 - Chwe - A proof of some Sch tzenberger‐type results.pdf (547.35 KB)

Date

1994-01

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Wiley

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.

Description

Open Access Article

Keywords

digraph, Eulerian paths, odd permutation, even permutation

Citation

Chwe, B-Y. (1994). A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs. International Journal of Mathematics and Mathematical Sciences, 17(3), 497-502. https://doi.org/10.1155/S0161171294000736

URI

https://ir.ua.edu/handle/123456789/17722

Collections

Research and Publications - Department of Mathematics