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.
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Wiley
1994-01-01
|
| श्रृंखला: | International Journal of Mathematics and Mathematical Sciences |
| विषय: | |
| ऑनलाइन पहुंच: | http://dx.doi.org/10.1155/S0161171294000736 |