Every connected acyclic digraph of height 1 is neighbourhood-realizable
Archivum Mathematicum (1991)
- Volume: 027, Issue: 1-2, page 133-135
- ISSN: 0044-8753
Access Full Article
top
How to cite
topZelinka, Bohdan. "Every connected acyclic digraph of height 1 is neighbourhood-realizable." Archivum Mathematicum 027.1-2 (1991): 133-135. <http://eudml.org/doc/18323>.
@article{Zelinka1991,
author = {Zelinka, Bohdan},
journal = {Archivum Mathematicum},
keywords = {acyclic digraph; neighbourhood realization},
language = {eng},
number = {1-2},
pages = {133-135},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {Every connected acyclic digraph of height 1 is neighbourhood-realizable},
url = {http://eudml.org/doc/18323},
volume = {027},
year = {1991},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - Every connected acyclic digraph of height 1 is neighbourhood-realizable
JO - Archivum Mathematicum
PY - 1991
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 027
IS - 1-2
SP - 133
EP - 135
LA - eng
KW - acyclic digraph; neighbourhood realization
UR - http://eudml.org/doc/18323
ER -
References
top- 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) Zbl0626.05018MR0930322
- B. Zelinka, Neighbourhood tournaments, Math. Slovaca 36 (1986), 241-244. (1986) Zbl0599.05027MR0866624
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.