1. The maximum number of strongly connected subtournaments;Beineke;Canad. Math. Bull.,1965
2. Tournaments, Ch. 7;Beineke,1978
3. D. Berman On the number of 5-cycles in a tournament, in: Proc. Sixth Southeastern Conf. Combinatorics, Graph Theory and Computing, Congress. Num. XIV (Utilitas Math., Winnipeg, 1975 pp. 101–108.
4. Doubly regular tournaments are equivalent to skew-Hadamard matrices;Brown;J. Combinatorial Theory Ser. A,1972
5. Sui circuiti nei grafi completi;Colombo;Boll. Un. Mat. Ital.,1964