Previous |  Up |  Next

Article

Title: Every connected acyclic digraph of height 1 is neighbourhood-realizable (English)
Author: Zelinka, Bohdan
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 27
Issue: 1
Year: 1991
Pages: 133-135
.
Category: math
.
MSC: 05C20
idZBL: Zbl 0758.05056
idMR: MR1189650
.
Date available: 2008-06-06T06:23:09Z
Last updated: 2012-05-09
Stable URL: http://hdl.handle.net/10338.dmlcz/107412
.
Reference: [1] : Theory of Graphs and Its Applications.Proc. Symp. Smolenice 1963. Academia Prague 1964.
Reference: [2] B. Zelinka: Neighbourhood digraphs.Arch. Math. Brno 23 (1987), 69-70. Zbl 0626.05018, MR 0930322
Reference: [3] B. Zelinka: Neighbourhood tournaments.Math. Slovaca 36 (1986), 241-244. Zbl 0599.05027, MR 0866624
.

Files

Files Size Format View
ArchMath_027-1991-1_16.pdf 309.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo