$D_0$-favouring Eulerian trails in digraphs

Previous | Up | Next

Article

$D_0$-favouring Eulerian trails in digraphs. (English). Archivum Mathematicum, vol. 25 (1989), issue 1, pp. 55-60

MSC: 05C20, 05C45 | MR 1189199 | Zbl 0708.05027

References:

[1] T. van Aardenne, Ehrenfest N. G. de Bruijn: Circuits and Trees in Oriented Linear Graphs. Simon Stevin 28 (1951) 203-217. MR 0047311

[2] L. W. Beineke R. J. Wilson: Selected Topics in Graph Theory 2. Academic Press, London, 1983. MR 0797246

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

[4] J. A. Bondy U. S. R. Murty: Graph Theory with Applications. American Elsevier, New Jork, and Mac Millan, London, 1976. MR 0411988

Partner of