In the other direction, because G is a subgraph of G , any tree decomposition of G forms a valid tree decomposition of G after removing the vertices in G − G, and hence tw(G ) ≥ tw(G).
tw(G ) = tw(G) Because every vertex in G has even degree, G has an Eulerian tour, that is, a path visiting every edge exactly once, beginning and ending at the same vertex.