S. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

S. Arnborg and A. Proskurowski, Characterization and Recognition of Partial 3-Trees, SIAM Journal on Algebraic Discrete Methods, vol.7, issue.2, pp.305-314, 1986.
DOI : 10.1137/0607033

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., A o(c k n) 5-approximation algorithm for treewidth, p.6321, 2013.

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.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

E. D. Demaine and M. Hajiaghayi, The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2008.
DOI : 10.1093/comjnl/bxm033

D. Dereniowski, W. Kubiak, and Y. Zwols, Minimum length path decompositions, p.2788, 2013.

B. Li, F. Z. Moataz, N. Nisse, and K. Suchan, Size-Constrained Tree Decompositions URL https, 2014.

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

D. P. Sanders, On Linear Recognition of Tree-Width at Most Four, SIAM Journal on Discrete Mathematics, vol.9, issue.1, pp.101-117, 1996.
DOI : 10.1137/S0895480193243043

J. A. Wald and C. J. Colbourn, Steiner trees, partial 2???trees, and minimum IFI networks, Networks, vol.1, issue.2, pp.159-167, 1983.
DOI : 10.1002/net.3230130202