Geodesic
$D_0$-favouring Eulerian trails in digraphs
Archivum mathematicum, Tome 25 (1989) no. 1-2, pp. 55-60 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C20, 05C45 
@article{ARM_1989_25_1-2_a7,
     author = {Fleischner, Herbert and Wenger, Emanuel},
     title = {$D_0$-favouring {Eulerian} trails in digraphs},
     journal = {Archivum mathematicum},
     pages = {55--60},
     year = {1989},
     volume = {25},
     number = {1-2},
     mrnumber = {1189199},
     zbl = {0708.05027},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a7/}
}
TY  - JOUR
AU  - Fleischner, Herbert
AU  - Wenger, Emanuel
TI  - $D_0$-favouring Eulerian trails in digraphs
JO  - Archivum mathematicum
PY  - 1989
SP  - 55
EP  - 60
VL  - 25
IS  - 1-2
UR  - http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a7/
LA  - en
ID  - ARM_1989_25_1-2_a7
ER  - 
%0 Journal Article
%A Fleischner, Herbert
%A Wenger, Emanuel
%T $D_0$-favouring Eulerian trails in digraphs
%J Archivum mathematicum
%D 1989
%P 55-60
%V 25
%N 1-2
%U http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a7/
%G en
%F ARM_1989_25_1-2_a7
Fleischner, Herbert; Wenger, Emanuel. $D_0$-favouring Eulerian trails in digraphs. Archivum mathematicum, Tome 25 (1989) no. 1-2, pp. 55-60. http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a7/

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

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

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

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