Product structure of graph classes with bounded treewidth

Journal article

We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the underlying treewidth of a graph class G to be the minimum non-negative integer c such that, for some function f, for every graph G∈G there is a graph H with tw(H)⩽c such that G is isomorphic to a subgraph of H⊠Kf(tw(G)). We introduce disjointed coverings of graphs and show they determine the underlying treewidth of any graph class. Using this result, we prove that the class of planar graphs has underlying treewidth 3; the class of Ks,t-minor-free graphs has underlying treewidth s (for t⩾max{s,3}); and the class of Kt-minor-free graphs has underlying treewidth t−2. In general, we prove that a monotone class has bounded underlying treewidth if and only if it excludes some fixed topological minor. We also study the underlying treewidth of graph classes defined by an excluded subgraph or excluded induced subgraph. We show that the class of graphs with no H subgraph has bounded underlying treewidth if and only if every component of H is a subdivided star, and that the class of graphs with no induced H subgraph has bounded underlying treewidth if and only if every component of H is a star

Authors: Campbell, R; Clinch, K; Distel, M; Gollin, JP; Hendrey, K

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Cambridge University Press
• Journal: Combinatorics, Probability and Computing
• Volume: 33
• Issue: 3
• Pages: 351-376
• Publication date: 2023-12-07
• DOI: 10.1017/s0963548323000457
• EISSN: 1469-2163
• ISSN: 0963-5483
• Language: English
• Keywords: Tree-depth; Clique-sum; Treewidth; Partial k-tree