P. Hlin?n´hlin?n´y and G. Whittle, Matroid tree-width, European Journal of Combinatorics, vol.27, issue.7, pp.1117-1128, 2006.
DOI : 10.1016/j.ejc.2006.06.005

S. Oum and P. D. Seymour, Approximating clique-width and branch-width, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.514-528, 2006.
DOI : 10.1016/j.jctb.2005.10.006

B. A. Reed, Tree Width and Tangles: A New Connectivity Measure and Some Applications, Surveys in Combinatorics, vol.241, pp.87-162, 1997.
DOI : 10.1017/CBO9780511662119.006

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027