Every connected acyclic digraph of height 1 is neighbourhood-realizable

Previous | Up | Next

Article

Every connected acyclic digraph of height 1 is neighbourhood-realizable. (English). Archivum Mathematicum, vol. 27 (1991), issue 1, pp. 133-135

MSC: 05C20 | MR 1189650 | Zbl 0758.05056

References:

[1] Theory of Graphs and Its Applications. Proc. Symp. Smolenice 1963. Academia Prague 1964.

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

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

Partner of