Graphs of Linear Growth have Bounded Treewidth
-
Published:2023-07-14
Issue:3
Volume:30
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Campbell Rutger,Distel Marc,Gollin J. Pascal,Harvey Daniel J.,Hendrey Kevin,Hickingbotham Robert,Mohar Bojan,Wood David
Abstract
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics