Tree width

The Tree width $tw(G)$ of a graph $G$ is the minimum width among all possible tree decompositions of $G$. Intuitively the lower tree width the more the $G$ resembles a tree. If $G$ is an undirected acyclic graph $tw(G)=1$.