EUDML | The Decomposition of a Digraph into Isotopic Subgraphs

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

Displaying similar documents to “The Decomposition of a Digraph into Isotopic Subgraphs”

On directed triangles in digraphs.

Hamburger, Peter, Haxell, Penny, Kostochka, Alexandr (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Randomly Eulerian digraphs

Gary Chartrand, Don R. Lick (1971)

Czechoslovak Mathematical Journal

Similarity:

Decomposition of a Digraph into Isomorphic Subgraphs

Bohdan Zelinka (1970)

Matematický časopis

Similarity:

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Similarity:

Every connected acyclic digraph of height 1 is neighbourhood-realizable

Bohdan Zelinka (1991)

Archivum Mathematicum

Similarity: