{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:13Z","timestamp":1753893793495,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/11657","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T09:23:12Z","timestamp":1689326592000},"source":"Crossref","is-referenced-by-count":1,"title":["Graphs of Linear Growth have Bounded Treewidth"],"prefix":"10.37236","volume":"30","author":[{"given":"Rutger","family":"Campbell","sequence":"first","affiliation":[]},{"given":"Marc","family":"Distel","sequence":"additional","affiliation":[]},{"given":"J. Pascal","family":"Gollin","sequence":"additional","affiliation":[]},{"given":"Daniel J.","family":"Harvey","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Hendrey","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Hickingbotham","sequence":"additional","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]},{"given":"David","family":"Wood","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2023,7,14]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p1\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T09:23:28Z","timestamp":1689326608000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v30i3p1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,7,14]]}},"URL":"https:\/\/doi.org\/10.37236\/11657","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2023,7,14]]},"article-number":"P3.1"}}