Results 61 to 70 of about 105 (77)
Generalizations of tournaments: A survey [PDF]
Journal of Graph Theory, 1998 We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure.
Jørgen Bang-Jensen, Gregory Gutin
exaly +4 more sources
Asymptotic normality of triad counts in random digraphs
Stochastic Models, 1989 Triad counts for directed graphs are represented as numerators of incomplete U-statistics with symmetric or asymmetric kernels. Asymptotic normality for the simultaneous distribution of all triad counts is proved. Applications are given to investigations
Krzysztof Nowicki
exaly +3 more sources
Some of the next articles are maybe not open access.
Subdivisions of digraphs in tournaments
Journal of Combinatorial Theory Series B, 2021Antonio Gira͂O +2 more
exaly
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
Journal of Combinatorial Theory Series B, 2017Daniela Kuhn, Deryk Osthus
exaly
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
Combinatorica, 1990Brendan D Mckay
exaly
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
ACM Transactions on Algorithms, 2018Christophe Paul +2 more
exaly
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
SIAM Journal on Discrete Mathematics, 2018Shuya Chiba, Tomoki Yamashita
exaly
Immersion of transitive tournaments in digraphs with large minimum outdegree
Journal of Combinatorial Theory Series B, 2019William Lochet
exaly
Graphs and digraphs with all 2-factors isomorphic
Journal of Combinatorial Theory Series B, 2004M Abreu, R E L Aldred, Martin Funk
exaly