D. Bienstock, 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

M. Chudnovsky, K. Kawarabayashi, and P. D. Seymour, Detecting even holes, Journal of Graph Theory, vol.40, issue.2, pp.85-111, 2005.
DOI : 10.1002/jgt.20040

M. Chudnovsky and P. D. Seymour, The structure of claw-free graphs, Surveys in combinatorics 2005, pp.153-171, 2005.
DOI : 10.1017/CBO9780511734885.008

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

X. Deng, P. Hell, and J. Huang, Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs, SIAM Journal on Computing, vol.25, issue.2, pp.390-403, 1996.
DOI : 10.1137/S0097539792269095

N. Derhy and C. Picouleau, Finding induced trees, Discrete Applied Mathematics, vol.157, issue.17, pp.3552-3557, 2009.
DOI : 10.1016/j.dam.2009.02.009
URL : https://hal.archives-ouvertes.fr/hal-01125590

N. Dehry, C. Picouleau, and N. Trotignon, The four-in-a-tree problem in triangle-free graphs, Graphs and Combinatorics, vol.25, pp.489-502, 2009.

R. Faudree, E. Flandrin, and Z. Ryjá?ek, Claw-free graphs ??? A survey, Discrete Mathematics, vol.164, issue.1-3, pp.87-147, 1997.
DOI : 10.1016/S0012-365X(96)00045-3

M. R. Fellows, The RobertsonSeymour theorems: A survey of applications, Proceedings of AMS- IMS-SIAM Joint Summer Research Conf. Contemporary Mathematics, pp.1-18, 1989.

P. Golovach, M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Induced packing of odd cycles in a planar graph, Proceedings of ISAAC 2009, pp.514-523, 2009.

R. Haas and M. Hoffmann, Chordless paths through three vertices, Theoretical Computer Science, vol.351, issue.3, pp.360-371, 2006.
DOI : 10.1016/j.tcs.2005.10.021

P. Van-'t-hof, M. Kami´nskikami´nski, and D. Paulusma, Finding induced paths of given parity in claw-free graphs, Proceedings of WG 2009

A. King and B. Reed, Bounding ?? in terms of ?? and ?? for quasi-line graphs, Journal of Graph Theory, vol.55, issue.3, pp.215-228, 2008.
DOI : 10.1002/jgt.20334

Y. Kobayashi and K. Kawarabayashi, The induced disjoint paths problem, Proceedings of IPCO 2008, pp.47-61, 2008.

Y. Kobayashi and K. Kawarabayashi, Algorithms for Finding an Induced Cycle in Planar Graphs and Bounded Genus Graphs, Proceedings of SODA 2009, pp.1146-1155, 2009.
DOI : 10.1137/1.9781611973068.124

B. Lévêque, D. Y. 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

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

M. Chudnovsky, N. Robertson, P. D. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, issue.1, pp.51-229, 2006.
DOI : 10.4007/annals.2006.164.51

S. Shrem, M. Stern, and M. C. Golumbic, Smallest odd holes in claw-free graphs, Proceedings of WG 2009, pp.329-340, 2009.

N. Trotignon and L. Wei, The k-in-a-tree problem for graphs of girth at least k
URL : https://hal.archives-ouvertes.fr/hal-00536454