L. Hans, J. Bodlaender, and . Engelfriet, Domino treewidth, J. Algorithms, vol.24, pp.94-123, 1997.

L. Hans, J. R. Bodlaender, H. Gilbert, T. Hafsteinsson, and . Kloks, Approximating treewidth, pathwidth, and minimum elimination tree height, J. Algorithms, vol.18, pp.238-255, 1995.

L. Hans and . Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, pp.1305-1317, 1996.

L. Hans and . Bodlaender, A partial ? -arboretum of graphs with bounded treewidth

G. Ding and B. Oporowski, Some results on tree decomposition of graphs, Journal of Graph Theory, vol.7, issue.4, pp.481-499, 1995.
DOI : 10.1002/jgt.3190200412

J. R. Gilbert, D. J. Rose, and A. Edenbrandt, A Separator Theorem for Chordal Graphs, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.3, pp.306-313, 1984.
DOI : 10.1137/0605032

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.
DOI : 10.1137/0611010

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1999.1919

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
URL : http://doi.org/10.1006/jctb.1999.1919