$D_0$-favouring Eulerian trails in digraphs
Fleischner, Herbert ; Wenger, Emanuel
Archivum Mathematicum, Tome 025 (1989), p. 55-60 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1989-01-01
Classification:  05C20,  05C45 
@article{107339,
     author = {Herbert Fleischner and Emanuel Wenger},
     title = {$D\_0$-favouring Eulerian trails in digraphs},
     journal = {Archivum Mathematicum},
     volume = {025},
     year = {1989},
     pages = {55-60},
     zbl = {0708.05027},
     mrnumber = {1189199},
     language = {en},
     url = {http://dml.mathdoc.fr/item/107339}
}

Fleischner, Herbert; Wenger, Emanuel. $D_0$-favouring Eulerian trails in digraphs. Archivum Mathematicum, Tome 025 (1989) pp. 55-60. http://gdmltest.u-ga.fr/item/107339/

T. Van Aardenne; Ehrenfest N. G. De Bruijn Circuits and Trees in Oriented Linear Graphs, Simon Stevin 28 (1951) 203-217. (1951) | MR 0047311

L. W. Beineke R. J. Wilson Selected Topics in Graph Theory 2, Academic Press, London, 1983. (1983) | MR 0797246

H. W. Berkowitz Restricted Eulerian Circuits in Directed Graphs, Coll. Math., Vol. 39, Fasc. 1 (1978), 185-188. (1978) | MR 0507280 | Zbl 0404.05042

J. A. Bondy U. S. R. Murty Graph Theory with Applications, American Elsevier, New Jork, and Mac Millan, London, 1976. (1976) | MR 0411988