R. Belmonte, P. A. Golovach, P. Heggernes, P. Van-'t-hof, M. Kaminski et al., Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths, Proceedings of the 22nd International Symposium on Algorithms and Computation, pp.110-119, 2011.
DOI : 10.1007/978-3-642-25591-5_13

R. Belmonte, P. Heggernes, and P. Van-'t-hof, Edge contractions in subclasses of chordal graphs, Discrete Applied Mathematics, vol.160, issue.7-8, pp.999-1010, 2012.
DOI : 10.1016/j.dam.2011.12.012

A. A. Bertossi, The edge Hamiltonian path problem is NP-complete, Information Processing Letters, vol.13, issue.4-5, pp.157-159, 1981.
DOI : 10.1016/0020-0190(81)90048-X

A. E. Brouwer and H. J. Veldman, Contractibility and NP-completeness, Journal of Graph Theory, vol.114, issue.1, pp.71-79, 1987.
DOI : 10.1002/jgt.3190110111
URL : http://purl.utwente.nl/publications/70829

M. R. Fellows, J. Kratochvíl, M. Middendorf, and F. Pfeiffer, The complexity of induced minors and related problems, Algorithmica, vol.30, issue.3, pp.266-282, 1995.
DOI : 10.1007/BF01190507

J. Fiala, M. Kami´nskikami´nski, B. Lidick´ylidick´y, and D. Paulusma, The k-in-a-Path Problem for Claw-free Graphs, Algorithmica, vol.63, issue.1-2, pp.499-519, 2012.
DOI : 10.1007/s00453-010-9468-z
URL : https://hal.archives-ouvertes.fr/inria-00455353

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
URL : http://doi.org/10.1016/s0012-365x(96)00045-3

M. R. Garey and D. S. Johnson, Computers and intractability, 1979.

P. A. Golovach, M. Kami´nskikami´nski, and D. Paulusma, Contracting a Chordal Graph to a Split Graph or a Tree, Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, pp.339-350, 2011.
DOI : 10.1007/978-3-642-22993-0_32

P. A. Golovach, M. Kaminski, D. Paulusma, and D. M. Thilikos, Containment relations in split graphs, Discrete Applied Mathematics, vol.160, issue.1-2, pp.155-163, 2012.
DOI : 10.1016/j.dam.2011.10.004

M. Grohe, K. Kawarabayashi, D. Marx, and P. Wollan, Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.479-488, 2011.
DOI : 10.1145/1993636.1993700
URL : http://arxiv.org/abs/1011.1827

F. Harary, Graph Theory, 1969.

P. Heggernes, P. Van-'t-hof, B. Lév?que, and C. Paul, Contracting chordal graphs and bipartite graphs to paths and trees, Proceedings of the 6th Latin-American Algorithms, Graphs and Optimization Symposium, pp.87-92, 2011.
DOI : 10.1016/j.endm.2011.05.016
URL : https://hal.archives-ouvertes.fr/lirmm-00620732

P. Van-'t-hof, M. Kami´nskikami´nski, D. Paulusma, S. Szeider, and D. M. Thilikos, On graph contractions and induced minors, Discrete Applied Mathematics, vol.160, pp.799-809, 2012.

P. Van-'t-hof, D. Paulusma, and G. J. Woeginger, Partitioning graphs into connected parts, Theoretical Computer Science, vol.410, pp.4834-4843, 2009.

M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Contractions of Planar Graphs in??Polynomial??Time, Proceedings of the 18th Annual European Symposium on Algorithms, pp.122-133, 2010.
DOI : 10.1007/978-3-642-15775-2_11

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

A. Levin, D. Paulusma, and G. J. Woeginger, The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases, Networks, vol.6, issue.3, pp.178-189, 2008.
DOI : 10.1002/net.20214

A. Levin, D. Paulusma, and G. J. Woeginger, The computational complexity of graph contractions II: Two tough polynomially solvable cases, Networks, vol.27, issue.1, pp.32-56, 2008.
DOI : 10.1002/net.20249

J. Matou?ek and R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Mathematics, vol.108, issue.1-3, pp.343-364, 1992.
DOI : 10.1016/0012-365X(92)90687-B

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