Bodlaender, H., Bonnet, E., Jaffke, L. et al. (6 more authors) (2025) Treewidth is NP-Complete on Cubic Graphs. The Electronic Journal of Combinatorics, 32 (3). P3.36. ISSN: 1077-8926
Abstract
In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new and simpler proof of the NP-completeness of treewidth, and show that Treewidth remains NP-complete on subcubic induced subgraphs of the infinite 3-dimensional grid, and on cubic line graphs.
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | © The authors. This is an open access article under the terms of the Creative Commons Attribution License (CC-BY-ND 4.0). |
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
| Funding Information: | Funder Grant number EPSRC (Engineering and Physical Sciences Research Council) EP/V00252X/1 |
| Date Deposited: | 30 May 2025 09:54 |
| Last Modified: | 03 Mar 2026 12:57 |
| Status: | Published |
| Publisher: | Electronic Journal of Combinatorics |
| Identification Number: | 10.37236/13205 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:227205 |
Download
Filename: 13205-PDF file-56335-1-10-20250814.pdf
Licence: CC-BY-ND 4.0

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)