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.
Saved in:
| Main Author: | |
|---|---|
| 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832566712201904128 |
|---|---|
| author | Byoung-Song Chwe |
| author_facet | Byoung-Song Chwe |
| author_sort | Byoung-Song Chwe |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ce84214af42e4752bd3dd1b5a423d0bb |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1994-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-ce84214af42e4752bd3dd1b5a423d0bb2025-02-03T01:03:23ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251994-01-0117349750210.1155/S0161171294000736A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphsByoung-Song Chwe0Department of Mathematics, University of Alabama, Tuscaloosa 35486, Alabama, USAThis 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.http://dx.doi.org/10.1155/S0161171294000736digraphEulerian pathsodd permutationeven permutation. |
| spellingShingle | Byoung-Song Chwe A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs International Journal of Mathematics and Mathematical Sciences digraph Eulerian paths odd permutation even permutation. |
| title | A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs |
| title_full | A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs |
| title_fullStr | A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs |
| title_full_unstemmed | A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs |
| title_short | A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs |
| title_sort | proof of some schutzenberger type results for eulerian paths and circuits on digraphs |
| topic | digraph Eulerian paths odd permutation even permutation. |
| url | http://dx.doi.org/10.1155/S0161171294000736 |
| work_keys_str_mv | AT byoungsongchwe aproofofsomeschutzenbergertyperesultsforeulerianpathsandcircuitsondigraphs AT byoungsongchwe proofofsomeschutzenbergertyperesultsforeulerianpathsandcircuitsondigraphs |