Every connected acyclic digraph of height 1 is neighbourhood-realizable
Zelinka, Bohdan
Archivum Mathematicum, Tome 027 (1991), p. 133-135 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1991-01-01
Classification:  05C20 
@article{107412,
     author = {Bohdan Zelinka},
     title = {Every connected acyclic digraph of height 1 is neighbourhood-realizable},
     journal = {Archivum Mathematicum},
     volume = {027},
     year = {1991},
     pages = {133-135},
     zbl = {0758.05056},
     mrnumber = {1189650},
     language = {en},
     url = {http://dml.mathdoc.fr/item/107412}
}

Zelinka, Bohdan. Every connected acyclic digraph of height 1 is neighbourhood-realizable. Archivum Mathematicum, Tome 027 (1991) pp. 133-135. http://gdmltest.u-ga.fr/item/107412/

Theory of Graphs and Its Applications, Proc. Symp. Smolenice 1963. Academia Prague 1964. (1963)

B. Zelinka Neighbourhood digraphs, Arch. Math. Brno 23 (1987), 69-70. (1987) | MR 0930322 | Zbl 0626.05018

B. Zelinka Neighbourhood tournaments, Math. Slovaca 36 (1986), 241-244. (1986) | MR 0866624 | Zbl 0599.05027