G. Jensen and . Gutin, Digraphs: Theory, Algorithms and Applications, 2008.

J. Bang-jensen, F. Havet, and A. K. , Maia de Oliveira Finding a subdivision of a digraph Theoretical Computer Science, pp.283-303, 2015.

D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer, DAG-Width and Parity Games, STACS 2006 Proc. 23rd Symposium on Theoretical Aspects of Computer Science, pp.524-536, 2006.
DOI : 10.1006/jctb.1993.1027
URL : http://web.comlab.ox.ac.uk/people/Stephan.Kreutzer/Publications/stacs06.pdf

J. A. Bondy and U. S. Murty, Graph Theory, Graduate Texts in Mathematics, vol.244, 2008.
DOI : 10.1007/978-1-84628-970-5

M. Chudnovsky, A. Scott, and P. D. Seymour, Disjoint paths in tournaments, Advances in Mathematics, vol.270, 2012.
DOI : 10.1016/j.aim.2014.11.011
URL : http://arxiv.org/pdf/1411.6226

S. Fortune, J. E. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00816135

F. Havet, A. K. Maia, and B. Mohar, Finding a subdivision of a prescribed digraph of order 4, Journal of Graph Theory, vol.147, issue.4, 2015.
DOI : 10.1006/jctb.2000.2031
URL : https://hal.archives-ouvertes.fr/hal-01202650

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001.
DOI : 10.1006/jctb.2000.2031
URL : https://doi.org/10.1006/jctb.2000.2031

K. Kawarabayashi and S. Kreutzer, The directed grid theorem. arXiv:1411, p.5681
DOI : 10.1145/2746539.2746586

W. Mccuaig, Intercyclic digraphs, Graph Structure Theory, vol.147, pp.203-245, 1993.
DOI : 10.1090/conm/147/01176

B. Reed, N. Robertson, P. D. Seymour, and R. Thomas, Packing directed circuits, Combinatorica, vol.2, issue.4, pp.535-554, 1996.
DOI : 10.1007/BF01271272