As already observed in Example 5, the inside tree decompositions of Section 3 are sub-optimal, in the sense that, regardless of the vertex ordering, they might not be able to provide the smallest possible width for a given graph.
as an example of a leaf node in the tree decomposition, consider node n with span [4,5] and Bag(n ) = {v 1 , v 4 , v 5 }.