EUDML | Isotopy of digraphs

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

Displaying similar documents to “Isotopy of digraphs”

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Similarity:

Every connected acyclic digraph of height 1 is neighbourhood-realizable

Bohdan Zelinka (1991)

Archivum Mathematicum

Similarity: