Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On minimal regular digraphs with given girth”
Randomly Eulerian digraphs
On (4, 2)-digraphs containing a cycle of length 2.
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
New proofs of the uniqueness of extremal noneven digraphs.
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Some remarks about digraphs with nonisomorphic - or -neighbourhoods
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity: