Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “The extremal connectivity of the strictly weak digraph”
Randomly Eulerian digraphs
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity:
Some remarks about digraphs with nonisomorphic - or -neighbourhoods
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
The signed k-domination number of directed graphs
Maryam Atapour, Seyyed Sheikholeslami, Rana Hajypory, Lutz Volkmann (2010)
Open Mathematics
Similarity: