S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.

C. Bazgan, C. Bentz, C. Picouleau, and B. Ries, Blockers for the Stability Number and the Chromatic Number, Graphs and Combinatorics, vol.31, issue.1, pp.73-90, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01126259

C. Bazgan, S. Toubaline, and Z. Tuza, The most vital nodes with respect to independent set and vertex cover, Discrete Applied Mathematics, vol.159, issue.17, pp.1933-1946, 2011.

C. Bentz, C. Marie-christine, D. De-werra, C. Picouleau, and B. Ries, Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid, Discrete Mathematics, vol.310, pp.132-146, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00974959

L. Hans, P. Bodlaender, D. Heggernes, and . Lokshtanov, Graph modification problems (dagstuhl seminar 14071), Dagstuhl Reports, vol.4, issue.2, pp.38-59, 2014.

B. Bollobás, P. A. Catlin, and P. Erdös, Hadwiger's Conjecture is True for Almost Every Graph, European Journal of Combinatorics, vol.1, issue.3, pp.195-199, 1980.

R. Márcia, C. G. Cerioli, R. Fernandes, J. Gómez, P. T. Gutiérrez et al., Transversals of longest paths, Discrete Mathematics, vol.343, issue.3, p.111717, 2020.

R. Márcia, P. T. Cerioli, and . Lima, Intersection of longest paths in graph classes, Discrete Applied Mathematics, 2019.

G. Chen, J. Ehrenmüller, C. G. Fernandes, C. G. Heise, S. Shan et al., Nonempty intersection of longest paths in series?parallel graphs, Discrete Mathematics, vol.340, issue.3, pp.287-304, 2017.

M. Costa, D. De-werra, and C. Picouleau, Minimum d-blockers and d-transversals in graphs, Journal of Combinatorial Optimization, vol.22, issue.4, pp.857-872, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00973849

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

C. Crespelle, F. V. Pål-grønås-drange, P. A. Fomin, and . Golovach, A survey of parameterized algorithms and the complexity of edge modification, p.2020

M. Cygan, F. V. Fomin, ?. Kowalik, D. Lokshtanov, D. Marx et al., Parameterized Algorithms, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.

M. Cygan, D. Marx, M. Pilipczuk, and M. Pilipczuk, Hitting forbidden subgraphs in graphs of bounded treewidth, Information and Computation, vol.256, pp.62-82, 2017.

R. Diestel, Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017.

D. Öznur-ya?ar-diner, C. Paulusma, B. Picouleau, and . Ries, Contraction and deletion blockers for perfect graphs and H-free graphs, Theoretical Computer Science, vol.746, pp.49-72, 2018.

G. Rodney, M. R. Downey, and . Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

B. Escoffier, L. Gourvès, and J. Monnot, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, Journal of Discrete Algorithms, vol.8, issue.1, pp.36-49, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00178912

V. Fedor, D. Fomin, I. Lokshtanov, S. Mihajlin, M. Saurabh et al., Computation of hadwiger number and related contraction problems: Tight lower bounds, p.2020

V. Fedor, S. Fomin, N. Saurabh, and . Misra, Graph modification problems: A modern perspective, Proc. of the 9th International Frontiers in Algorithmics Workshop (FAW), vol.9130, pp.3-6, 2015.

E. Galby, P. T. Lima, and B. Ries, Blocking dominating sets for H-free graphs via edge contractions, Proc. of the 30th International Symposium on Algorithms and Computation, vol.149, pp.1-24, 2019.

E. Galby, P. T. Lima, and B. Ries, Reducing the domination number of graphs via edge contractions, Proc. of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 138 of LIPIcs, vol.41, pp.1-41, 2019.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

P. A. Golovach, P. Heggernes, P. Van-'t-hof, and C. Paul, Hadwiger Number of Graphs with Small Chordality, SIAM Journal on Discrete Mathematics, vol.29, issue.3, pp.1427-1451, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01178217

P. Heggernes, P. Van ?t-hof, B. Lévêque, D. Lokshtanov, and C. Paul, Contracting Graphs to Paths and Trees, Algorithmica, vol.68, issue.1, pp.109-132, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-01076841

P. Heggernes, P. V. Hof, D. Lokshtanov, and C. Paul, Obtaining a Bipartite Graph by Contracting Few Edges, SIAM Journal on Discrete Mathematics, vol.27, issue.4, pp.2143-2156, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01178184

R. Impagliazzo and R. Paturi, On the Complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001.

R. Impagliazzo, R. Paturi, and F. Zane, Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.

R. Krithika, P. Misra, A. Rai, and P. Tale, Lossy kernels for graph contraction problems, Proc. of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 65 of LIPIcs, vol.23, pp.1-23, 2016.

J. M. Lewis and M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, Journal of Computer and System Sciences, vol.20, issue.2, pp.219-230, 1980.

F. Mahdavi-pajouh, V. Boginski, and E. L. Pasiliao, Minimum vertex blocker clique problem, Networks, vol.64, issue.1, pp.48-64, 2014.

D. Paulusma, C. Picouleau, and B. Ries, Critical vertices and edges inH-free graphs, Discrete Applied Mathematics, vol.257, pp.361-367, 2019.

D. Rautenbach and J. Sereni, Transversals of Longest Paths and Cycles, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.335-341, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00793271

N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986.

T. Watanabe, T. Ae, and A. Nakamura, On the NP-hardness of edge-deletion and -contraction problems, Discrete Applied Mathematics, vol.6, issue.1, pp.63-78, 1983.

M. Yannakakis, Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, pp.253-264, 1978.