Alternating connectivity of digraphs
Bohdan Zelinka (1971)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Three-linking in Eulerian digraphs”
Alternating connectivity of digraphs
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity:
Neighbourhood digraphs
Bohdan Zelinka (1987)
Archivum Mathematicum
Similarity: