Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Centers of directed cacti”
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Nearly acyclic digraphs
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity:
Neighbourhood digraphs
Bohdan Zelinka (1987)
Archivum Mathematicum
Similarity:
On the existence of critically n-connected graphs
Ferdinand Gliviak (1976)
Mathematica Slovaca
Similarity: