A. Benhocine and A. P. Wojda, On the existence of specified cycles in a tournament, Journal of Graph Theory, vol.28, issue.4, pp.469-473, 1983.
DOI : 10.1002/jgt.3190070413

J. A. Bondy, Diconnected Orientations and a Conjecture of Las Vergnas, Journal of the London Mathematical Society, vol.2, issue.2, pp.14-277, 1976.
DOI : 10.1112/jlms/s2-14.2.277

S. A. Burr, Subtrees of directed graphs and hypergraphs, Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, pp.227-239, 1980.

A. El-sahili and M. Kouider, About paths with two blocks

P. Erd?-os, Graph theory and probability, Canad, J. Math, vol.11, pp.34-38, 1959.

F. Havet and S. Thomassé, Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture, Journal of Combinatorial Theory, Series B, vol.78, issue.2, pp.78-243, 2000.
DOI : 10.1006/jctb.1999.1945

F. Havet and S. Thomassé, Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture, Journal of Graph Theory, vol.1036, issue.166, pp.244-256, 2000.
DOI : 10.1002/1097-0118(200012)35:4<244::AID-JGT2>3.0.CO;2-H

T. Gallai, On directed paths and circuits, Theory of Graphs, Proc. Colloq., Tihany, pp.115-118, 1966.

B. Roy, Nombre chromatique et plus longs chemins d'un graphe, Rev. Française Informat, Recherche Opérationelle, vol.1, pp.129-132, 1967.
DOI : 10.1051/m2an/1967010501291