This subtree has treewidth 4d i − 1, and can be constructed in a linear chain adding vertices from D i one at a time.
we process the nodes in D i in columnmajor order, at each step constructing a new node in the tree decomposition of D by adding one vertex of D i , either red or green, and removing the corresponding vertex from the previous red or green column respectively.