On the complexity of testing for odd holes and induced odd paths, Discrete Mathematics, vol.90, issue.1, pp.85-92, 1991. ,
DOI : 10.1016/0012-365X(91)90098-M
Excluding induced subgraphs, Surveys in Combinatorics, pp.99-119, 2007. ,
DOI : 10.1017/CBO9780511666209.005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.1758
The three-in-a-tree problem, Combinatorica, vol.19, issue.2 ,
DOI : 10.1007/s00493-010-2334-4
Algorithmic Graph Theory, 1985. ,
Detecting induced subgraphs. Manuscript, 2007. ,
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.1, pp.51-71, 2008. ,
DOI : 10.1137/050628520