Digraphs: Theory, Algorithms and Applications. Springer Mono- 7 graphs in Mathematics, 2008. ,
DOI : 10.1007/978-1-84800-998-1
Disjoint directed and undirected paths and cycles in digraphs, Theoretical Computer Science, vol.410, issue.47-49, pp.5138-5144, 2009. ,
DOI : 10.1016/j.tcs.2009.08.034
On the complexity of testing for odd holes and induced odd paths, Discrete Mathematics, vol.90, issue.1 ,
DOI : 10.1016/0012-365X(91)90098-M
See also Corrigendum by B. Reed, Discrete Math, pp.85-92109, 1991. ,
Excluding induced subgraphs, Surveys in Combinatorics, pp.99-119, 2007. ,
DOI : 10.1017/CBO9780511666209.005
The three-in-a-tree problem, Combinatorica, vol.19, issue.2, p.16, 2007. ,
DOI : 10.1007/s00493-010-2334-4
The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980. ,
DOI : 10.1016/0304-3975(80)90009-2
Detecting induced subgraphs ,
Induced disjoint paths problem in a planar digraph Discrete Applied Mathemat- 21 ics 157, pp.3231-3238, 2009. ,
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