J. Bang-jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, 2008.
DOI : 10.1007/978-1-84800-998-1

J. Bang-jensen, F. Havet, and N. Trotignon, Finding an induced subdivision of a digraph, Theoretical Computer Science, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00638464

J. Bang-jensen and M. Kriesell, Disjoint directed and undirected paths and cycles in digraphs Theoretical Computer Science 410, pp.5138-5144, 2009.

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.1007/11672142_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.9018

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

M. Chudnovsky and P. D. Seymour, Excluding induced subgraphs, Surveys in Combinatorics, pp.99-119, 2007.
DOI : 10.1017/CBO9780511666209.005

M. Chudnovsky and P. D. Seymour, The three-in-a-tree problem, Combinatorica, vol.19, issue.2, pp.387-417, 2010.
DOI : 10.1007/s00493-010-2334-4

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

H. N. Gabow and S. Nie, Finding a long directed cycle, Proceedings of the fifteenth annual ACM- SIAM symposium on Discrete algorithms, pp.49-58, 2004.
DOI : 10.1145/1328911.1328918

H. N. Gabow and S. Nie, Finding a long directed cycle, ACM Transactions on Algorithms, vol.4, issue.1, 2008.
DOI : 10.1145/1328911.1328918

M. Grohe and M. , Grüber Parameterized approximability of the disjoint cycle problem, Proceedings of the 34th International Colloquium on Automata, Languages and Programming, pp.363-374, 2007.

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

B. Lévêque, D. Lin, F. Maffray, and N. Trotignon, Detecting induced subgraphs, Discrete Applied Mathematics, vol.157, issue.17, pp.3540-3551, 2009.
DOI : 10.1016/j.dam.2009.02.015

W. Mccuaig, Intercyclic digraphs, Graph structure theory Contemp. Math. 147, pp.203-245, 1991.
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5838

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006

A. Slivkins, Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs, Proceedings of the 11th Annual European Symposium on Algorithms, ESA 03, pp.482-493, 2003.
DOI : 10.1137/070697781

C. Thomassen, Highly connected non-2-linked digraphs, Combinatorica, vol.1, issue.4, pp.393-395, 1991.
DOI : 10.1007/BF01275674