Hence, the path between any two occurrences of i in T G contains nodes that also contain i, guaranteeing the running intersection property of T G .
by constructing D from G, finding an optimal tree decomposition of D, and then translating the result into a tree decomposition of G, we have a tree decomposition of G having width SOL where SOL ≤ 2tw(D).