B. Alspach and M. Rosenfeld, Realization of certain generalized paths in tournaments, Discrete Math, vol.34, pp.199-202, 1981.

J. Bondy and U. Murty, Graph Theory, 2008.

S. Ceroi and F. Havet, Trees with three leaves are (n+1)-unavoidable, vol.141, pp.19-39, 2004.

A. El-sahili, Trees in tournaments, J. Combin. Theory Ser. B, vol.92, pp.183-187, 2004.

R. Forcade, Parity of paths and circuits in tournaments, Discrete Math, vol.6, pp.115-118, 1973.

B. Grünbaum, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory Ser. B, vol.11, pp.249-257, 1971.

R. Häggkvist and A. Thomason, Trees in tournaments, vol.11, pp.123-130, 1991.

F. Havet, Trees in tournaments, Discrete Mathematics, vol.243, pp.121-134, 2002.

F. Havet, On unavoidability of trees with k leaves, Graphs and Combinatorics, vol.19, pp.101-110, 2003.

F. Havet and S. Thomassé, Median orders of tournaments: a tool for the second neighborhood problem and Sumner's conjecture, J. Graph Theory, vol.35, pp.244-256, 2000.

F. Havet and S. Thomassé, Oriented hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture, J. Combin. Theory Ser. B, vol.78, pp.243-273, 2000.

D. Kühn, R. Mycroft, and D. Osthus, A proof of Sumner's universal tournament conjecture for large tournaments, Proceedings London Math. Soc, vol.102, pp.731-766, 2011.

D. Kühn, R. Mycroft, and D. Osthus, An approximate version of Sumner's universal tournament conjecture, J. Combin. Theory, Ser. B, vol.101, pp.415-447, 2011.

L. Rédei, Ein kombinatorischer Satz, Acta. Litt. Sci. Szeged, vol.7, pp.39-43, 1934.

K. Reid and N. C. Wormald, Embedding oriented n-trees in tournaments, Studia Scientiarum Mathematicarum Hungarica, vol.18, pp.377-387, 1983.

M. Rosenfeld, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory Ser. B, vol.12, pp.93-99, 1971.

H. Straight, The existence of certain type of semi-walks in tournaments, Congr. Numer, vol.29, pp.901-908, 1980.

A. Thomason, Paths and cycles in tournaments, Trans. Amer. Math. Soc, vol.296, pp.167-180, 1986.

F. Dross and F. , Havet / Electronic Notes in Theoretical Computer Science, vol.346, pp.425-436, 2019.