Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
CUCKLER, BILL
2007.
Hamiltonian Cycles in Regular Tournaments.
Combinatorics, Probability and Computing,
Vol. 16,
Issue. 2,
p.
239.
Kühn, Daniela
and
Osthus, Deryk
2012.
A survey on Hamilton cycles in directed graphs.
European Journal of Combinatorics,
Vol. 33,
Issue. 5,
p.
750.
Hassanzadeh, Farzad Farnoud
Yaakobi, Eitan
Touri, Behrouz
Milenkovic, Olgica
and
Bruck, Jehoshua
2013.
Building consensus via iterative voting.
p.
1082.
Ferber, Asaf
Krivelevich, Michael
and
Sudakov, Benny
2017.
Counting and packing Hamilton cycles in dense graphs and oriented graphs.
Journal of Combinatorial Theory, Series B,
Vol. 122,
Issue. ,
p.
196.
YUSTER, RAPHAEL
2017.
On the Maximum Number of Spanning Copies of an Orientation in a Tournament.
Combinatorics, Probability and Computing,
Vol. 26,
Issue. 5,
p.
775.
Yuster, Raphael
2022.
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs.
Journal of Combinatorial Theory, Series B,
Vol. 153,
Issue. ,
p.
195.
Ai, Jiangdong
Gutin, Gregory
Lei, Hui
Yeo, Anders
and
Zhou, Yacong
2025.
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials.
Journal of Graph Theory,