Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets

TL;DR

This paper investigates how certain graph decompositions involving cutsets can ensure bounded treewidth in hereditary graph classes, extending understanding of graph structure and complexity.

Contribution

It demonstrates that graphs decomposable by clique cutsets, 2-cutsets, and 1-joins into bounded treewidth classes also have bounded treewidth, especially for ($ISK_4$, wheel)-free graphs and graphs with no cycle with a unique chord.

Findings

Graphs with bounded treewidth are $t$-clean for some $t$.

Decompositions by specific cutsets preserve bounded treewidth.

Bounded treewidth results apply to ($ISK_4$, wheel)-free graphs and graphs with no cycle with a unique chord.

Abstract

This paper continues a series of papers investigating the following question: which hereditary graph classes have bounded treewidth? We call a graph $t$-clean if it does not contain as an induced subgraph the complete graph $K_t$, the complete bipartite graph $K_{t, t}$, subdivisions of a $(t \times t)$-wall, and line graphs of subdivisions of a $(t \times t)$-wall. It is known that graphs with bounded treewidth must be $t$-clean for some $t$; however, it is not true that every $t$-clean graph has bounded treewidth. In this paper, we show that three types of cutsets, namely clique cutsets, 2-cutsets, and 1-joins, interact well with treewidth and with each other, so graphs that are decomposable by these cutsets into basic classes of bounded treewidth have bounded treewidth. We apply this result to two hereditary graph classes, the class of ($ISK_4$, wheel)-free graphs and the class of graphs with no cycle with a unique chord. These classes were previously studied and decomposition theorems were obtained for both classes. Our main results are that $t$-clean ($ISK_4$, wheel)-free graphs have bounded treewidth and that $t$-clean graphs with no cycle with a unique chord have bounded treewidth.