EUDML | Three-linking in Eulerian digraphs

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Three-linking in Eulerian digraphs”

Alternating connectivity of digraphs

Bohdan Zelinka (1971)

Časopis pro pěstování matematiky

Similarity:

Every connected acyclic digraph of height 1 is neighbourhood-realizable

Bohdan Zelinka (1991)

Archivum Mathematicum

Similarity:

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Similarity: