Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Seifter, Norbert, Trofimov, Vladimir I. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Bhargava, T.N., O'Korn, L.J. (1967)
Portugaliae mathematica
Similarity:
Zofia Majcher, Jerzy Michael (1998)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph such that for each its vertex, vertices of the out-neighbourhood have different in-degrees and vertices of the in-neighbourhood have different out-degrees, will be called an HI-digraph. In this paper, we give a characterization of sequences of pairs of out- and in-degrees of HI-digraphs.
Hamburger, Peter, Haxell, Penny, Kostochka, Alexandr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: