Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka · Czech digital mathematics library · 1991
A digraph H is called neighbourhood-realizable, if there exists a digraph G with the property that for each vertex v of G the set of terminal vertices of edges outgoing from v induces a subgraph isomorphic to H.The assertion in the title of the paper is proved.