Every connected acyclic digraph of height 1 is neighbourhood-realizable
Archivum mathematicum, Tome 27 (1991) no. 1-2, pp. 133-135.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Classification : 05C20
@article{ARM_1991__27_1-2_a15,
     author = {Zelinka, Bohdan},
     title = {Every connected acyclic digraph of height 1 is neighbourhood-realizable},
     journal = {Archivum mathematicum},
     pages = {133--135},
     publisher = {mathdoc},
     volume = {27},
     number = {1-2},
     year = {1991},
     mrnumber = {1189650},
     zbl = {0758.05056},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ARM_1991__27_1-2_a15/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Every connected acyclic digraph of height 1 is neighbourhood-realizable
JO  - Archivum mathematicum
PY  - 1991
SP  - 133
EP  - 135
VL  - 27
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ARM_1991__27_1-2_a15/
LA  - en
ID  - ARM_1991__27_1-2_a15
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Every connected acyclic digraph of height 1 is neighbourhood-realizable
%J Archivum mathematicum
%D 1991
%P 133-135
%V 27
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ARM_1991__27_1-2_a15/
%G en
%F ARM_1991__27_1-2_a15
Zelinka, Bohdan. Every connected acyclic digraph of height 1 is neighbourhood-realizable. Archivum mathematicum, Tome 27 (1991) no. 1-2, pp. 133-135. http://geodesic.mathdoc.fr/item/ARM_1991__27_1-2_a15/