@article{06a82897bf854d3591e652e9e806e1c6,
title = "Graphs of Linear Growth have Bounded Treewidth",
abstract = "A graph class G has linear growth if, for each graph G ∈ 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. Mathematics Subject Classifications: 05C83, 05C62.",
author = "Rutger Campbell and Marc Distel and Gollin, {J. Pascal} and Harvey, {Daniel J.} and Kevin Hendrey and Robert Hickingbotham and Bojan Mohar and Wood, {David R.}",
note = "Funding Information: Research of Rutger Campbell and Kevin Hendrey is supported by the Institute for Basic Science (IBS-R029-C1). Research of J. Pascal Gollin is supported by the Institute for Basic Science (IBS-R029-Y3). Bojan Mohar is supported in part by the NSERC grant R611450. Daniel J. Harvey is partially supported by JSPS KAKENHI grant 22H03550. Research of Marc Distel and Robert Hickingbotham is supported by Australian Government Research Training Program scholarships. Research of David Wood is supported by the Australian Research Council. Publisher Copyright: {\textcopyright} The authors.",
year = "2023",
month = jul,
day = "14",
doi = "10.37236/11657",
language = "English",
volume = "30",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Clemson University Digital Press",
number = "3",
}