Previous |  Up |  Next

Article

Title: $D_0$-favouring Eulerian trails in digraphs (English)
Author: Fleischner, Herbert
Author: Wenger, Emanuel
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 25
Issue: 1
Year: 1989
Pages: 55-60
.
Category: math
.
MSC: 05C20
MSC: 05C45
idZBL: Zbl 0708.05027
idMR: MR1189199
.
Date available: 2008-06-06T06:19:48Z
Last updated: 2012-05-09
Stable URL: http://hdl.handle.net/10338.dmlcz/107339
.
Reference: [1] T. van Aardenne, Ehrenfest N. G. de Bruijn: Circuits and Trees in Oriented Linear Graphs.Simon Stevin 28 (1951) 203-217. MR 0047311
Reference: [2] L. W. Beineke R. J. Wilson: Selected Topics in Graph Theory 2.Academic Press, London, 1983. MR 0797246
Reference: [3] H. W. Berkowitz: Restricted Eulerian Circuits in Directed Graphs.Coll. Math., Vol. 39, Fasc. 1 (1978), 185-188. Zbl 0404.05042, MR 0507280
Reference: [4] J. A. Bondy U. S. R. Murty: Graph Theory with Applications.American Elsevier, New Jork, and Mac Millan, London, 1976. MR 0411988
.

Files

Files Size Format View
ArchMath_025-1989-1_8.pdf 591.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo