Z. Bai, J. Tu, and Y. Shi, Treewidth of treewidth-bounded graphs, Treewidth, pp.173-183

J. Baste and I. Sau, The role of planarity in connectivity problems parameterized by treewidth, Theoretical Computer Science, vol.570, pp.1-14, 2015.
URL : https://hal.archives-ouvertes.fr/dumas-00854884

J. Baste, I. Sau, and D. M. Thilikos, Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

J. Baste and I. Sau, The Role of Planarity in Connectivity Problems Parameterized by Treewidth, Parameterized and Exact Computation, vol.115, pp.63-74, 2014.
URL : https://hal.archives-ouvertes.fr/dumas-00854884

J. Baste, I. Sau, and D. M. Thilikos, Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds, SIAM Journal on Discrete Mathematics, vol.34, issue.3, pp.1623-1648, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

J. Baste, I. Sau, and D. M. Thilikos, Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

J. Baste, I. Sau, and D. M. Thilikos, A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.951-970, 2020.

H. L. Bodlaender, M. Cygan, S. Kratsch, and J. Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015.

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009.

J. A. Bondy and U. S. Murty, Graph Theory, Graph Theory. Graduate Texts in Mathematics, 2008.

É. Bonnet, N. Brettell, O. Kwon, and D. Marx, Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms, Algorithmica, vol.81, issue.10, pp.3890-3935, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01994406

M. Bougeret and I. Sau, How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?, Algorithmica, vol.81, issue.10, pp.4043-4068, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01730228

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

M. Cygan, F. V. Fomin, ?. Kowalik, D. Lokshtanov, D. Marx et al., Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015.

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Rooij et al., Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.150-159, 2011.

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

R. G. Downey and M. R. Fellows, Parameterized Approximation, Texts in Computer Science, pp.623-644, 2013.

F. V. Fomin, D. Lokshtanov, F. Panolan, and S. Saurabh, Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms, Journal of the ACM, vol.63, issue.4, pp.1-60, 2016.

J. E. Hopcroft and R. E. Tarjan, Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973.

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.

B. M. Jansen, D. Lokshtanov, and S. Saurabh, A Near-Optimal Planarization Algorithm, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1802-1811, 2013.

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982.

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011.

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.760-776, 2011.

M. Pilipczuk, A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics, vol.231, pp.211-216, 2017.

J. Tu, L. Wu, J. Yuan, and L. Cui, On the vertex cover $$P_3$$ P 3 problem parameterized by treewidth, Journal of Combinatorial Optimization, vol.34, issue.2, pp.414-425, 2016.

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.