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.
Displaying similar documents to “Short cycles in digraphs with local average outdegree at least two.”
Randomly Eulerian digraphs
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:
Reachability relations and the structure of transitive digraphs.
Seifter, Norbert, Trofimov, Vladimir I. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A remark on almost Moore digraphs of degree three.
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
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:
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:
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.
On Bratton's conjecture and a theorem of Luce
Bhargava, T.N., O'Korn, L.J. (1967)
Portugaliae mathematica
Similarity:
Degree sequences of digraphs with highly irregular property
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.
On directed triangles in digraphs.
Hamburger, Peter, Haxell, Penny, Kostochka, Alexandr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: