Abrishami, TaraChudnovsky, MariaHajebi, SepehrSpirkl, Sophie2024-10-232024-10-232025-01https://doi.org/10.1016/j.disc.2024.114195https://hdl.handle.net/10012/21162The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2024.114195. © 2025. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/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 Kt, the complete bipartite graph Kt,t, subdivisions of a (t x t)-wall, and line graphs of subdivisions of a (t x 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 (ISK4, well)-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 (ISK4, wheel)-free graphs have bounded treewidth and that t-clean graphs with no cycle with a unique chord have bounded treewidth.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/treewidthinduced subgraphstree decompositionsArticle