  A graph class $\mathcal{G}$ has linear growth if, for each graph $G \in
\mathcal{G}$ and every positive integer $r$, every subgraph of $G$ with radius
at most $r$ contains $O(r)$ vertices. In this paper, we show that every graph
class with linear growth has bounded treewidth.
