Bodlaender1998

https://www.doi.org/10.1016/S0304-3975(97)00228-4

@article{Bodlaender1998,
author = {Hans L. Bodlaender},
doi = {10.1016/S0304-3975(97)00228-4},
issn = {0304-3975},
journaltitle = {Theoretical Computer Science},
number = {1},
pages = {1--45},
title = {A partial $k$-arboretum of graphs with bounded treewidth},
volume = {209},
year = {1998},
}

• page 4 : pathwidth $k$ upper bounds treewidth by $\mathcal O(k)$ – Lemma 3. (a) For all graphs $G$, $pathwidth(G) \ge treewidth(G)$. …
• page 5 : branch width – A \emph{branch decomposition} of a graph $G=(V,E)$ is a pair $(T=(I,F),\sigma)$, where $T$ is a tree with every node in $T$ of degree one of three, and $\sigma$ is a bijection from $E$ to the set of leaves in $T$. The \emph{order} of an edge $f \in F$ is the number of vertices $v \in V$, for which there exist adjacent edges $(v,w),(v,x) \in E$, such that the path in $T$ from $\sigma(v,w)$ to $\sigma(v,x)$ uses $f$. The \emph{width} of branch decomposition $(T=(I,F),\sigma)$, is the maximum order over all edges $f \in F$. The \emph{branchwidth} of $G$ is the minimum width over all branch decompositions of $G$.
• page 22 : bandwidth – Let $G=(V,E)$ be a graph, and let $f\colon V\to {1,2,\dots,n}$ be a linear ordering of $G$. 1. The \emph{bandwidth} of $f$ is $\max{|f(v)-f(w)| \mid (v,w) \in E}$. … The bandwidth … is the minimum bandwidth … over all possible linear orderings of $G$.
• page 22 : cutwidth – Let $G=(V,E)$ be a graph, and let $f\colon V\to {1,2,\dots,n}$ be a linear ordering of $G$. … 2. The \emph{cutwidth} of $f$ is $\max_{1\le i\le n} |{(u,v)\in E \mid f(u) \le i < f(v) }|$. … [cutwidth] of a graph $G$ is the minimum [cutwidth] … over all possible linear orderings of $G$.
• page 22 : topological bandwidth – The \emph{topological bandwidth} of a graph $G$ is the minimum bandwidth over all graphs $G’$ which are obtained by addition of an arbitrary number of vertices along edges of $G$.
• page 23 : bandwidth $k$ upper bounds pathwidth by $\mathcal O(k)$ – Theorem 44. For every graph $G$, the pathwidth of $G$ is at most the bandwidth of $G$, … Proof. Let $f \colon V\to {1,\dots,n}$ be a linear ordering of $G$ with bandwidth $k$. Then $(X_1,\dots,X_{n-k})$ with $X_i={f^{-1}(i), f^{-1}(i+1), \dots, f^{-1}(i+k)}$ is a path decomposition of $G$ with pathwidth $k$. …
• page 23 : topological bandwidth $k$ upper bounds pathwidth by $\mathcal O(k)$ – Theorem 45. For every graph $G$, the pathwidth of $G$ is at most the topological band-width of $G$.
• page 24 : cutwidth $k$ upper bounds pathwidth by $\mathcal O(k)$ – Theorem 47. For every graph $G$, the pathwidth of $G$ is at most the cutwidth of $G$.
• page 24 : pathwidth+maxdegree $k$ upper bounds cutwidth by $\mathcal O(k)$ – Theorem 49.
• page 24 : cutwidth $k$ upper bounds pathwidth+maxdegree by $\mathcal O(k)$ – Theorem 49.
• page 34 : outerplanar upper bounds treewidth by a constant – Lemma 78. Every outerplanar graph $G=(V,E)$ has treewidth at most 2.
• page 37 : bounded grid does not imply bounded treewidth – Lemma 88. The treewidth of an $n \times n$ grid graph … is at least $n$.
• page 38 : treewidth $k$ upper bounds minimum degree by $\mathcal O(k)$ – Lemma 90 (Scheffler [94]). Every graph of treewidth at most $k$ contains a vertex of degree at most $k$.