A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
From MaRDI portal
Publication:1335502
DOI10.1155/S0161171294000736zbMath0808.05053MaRDI QIDQ1335502
Publication date: 9 October 1994
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/47088
Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs