Proposition 17 ([1]}) 
Given a bounded treewidth graph \(G\) , a balanced tree decompositionA tree
decomposition of a graph is said to be balanced if the tree
underlying the decomposition is balanced of \(G\)  is obtainable in \(\mbox{{\sf L}}\) .

