1. Cycles of each length in regular tournaments;Alspach;Canad. Math. Bull.,1967
2. Bypasses in asymmetric digraphs;Alspach;J. Combinatorial Theory Ser. B,1974
3. L. W. Beineke and K. B. Reid, Survey article on tournaments, in “Selected Topics in Graph Theory” (L. W. Beineke and R. J. Wilson, eds.), Academic Press, New York, in press.
4. Une condition sufficante d'existence d'un circuit Hamiltonien;Ghouila-Houri;C. R. Acad. Sci. Paris,1960
5. Cycles in k-strong tournaments;Goldberg;Pacific J. Math.,1972