Neighbourhood digraphs
Bohdan Zelinka (1987)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Decomposition of a Digraph into Isomorphic Subgraphs”
Neighbourhood digraphs
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity:
The decomposition of a generalized graph into isomorphic subgraphs
Bohdan Zelinka (1968)
Časopis pro pěstování matematiky
Similarity:
Decomposition of the Complete Directed Graph into Two Factors with Given Diameters
Štefan Znám (1970)
Matematický časopis
Similarity: