EUDML | Decomposition of a Digraph into Isomorphic Subgraphs

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

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

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

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Similarity:

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: