1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)
2. Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C. R. Acad. Sci. Paris 249, 2151–2152 (1959)
3. Feng, J., Li, S., Li, R.: An s-strong tournament with s ≥ 3 has s + 1 vertices whose out-arcs are 4-pancyclic. Discrete Appl. Math. 154, 2609–2612 (2006)
4. Goldberg, M., Moon, J.W.: Cycles in k-strong tournaments. Pacific J. Math. 40, 89–96 (1972)
5. Li, R., Li, S., Feng, J.: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. Discrete Appl. Math. 156, 88–92 (2008)