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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Short score certificates for upset tournaments.”
New proofs of the uniqueness of extremal noneven digraphs.
Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Some remarks on Menger's theorem
Bohdan Zelinka (1971)
Časopis pro pěstování matematiky
Similarity:
On the complete digraphs which are simply disconnected.
Davide C. Demaria, José Carlos de Souza Kiihl (1991)
Publicacions Matemàtiques
Similarity:
Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments.
-favouring Eulerian trails in digraphs
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity: