page 3 : outerthickness – The outerthickness of a graph $G$, …, is the minimum number of outerplanar subgraphs that partition (ed: edges of) $G$.
page 5 : treewidth $k$ upper bounds outerthickness by $\mathcal O(k)$ – Proposition 3. The maximum outerthickness of a graph in $\mathcal T_k$ (ed: $k$-tree) is $k$; …
