The most important among these graph parameters is indubitably tree-width, which associates to every graph the minimum width over all of its possible tree decompositions. Tree-width has many applications in parameterized complexity [1]}, [2]} and has played a key part in the proof of the celebrated Robertson-Seymour graph minor theorem [3]}.
