Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Some remarks on Menger's theorem”
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Neighbourhood digraphs
Bohdan Zelinka (1987)
Archivum Mathematicum
Similarity:
On some graph-theoretical problems of V. G. Vizing
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
Similarity:
Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity: