{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:10:58Z","timestamp":1755828658371,"version":"3.44.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/13205","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:04:54Z","timestamp":1755785094000},"source":"Crossref","is-referenced-by-count":0,"title":["Treewidth is NP-Complete on Cubic Graphs"],"prefix":"10.37236","volume":"32","author":[{"given":"Hans","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"\u00c9douard","family":"Bonnet","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Jaffke","sequence":"additional","affiliation":[]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[]},{"given":"Paloma","family":"Lima","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[]},{"given":"Sukanya","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2025,8,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p36\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p36\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:04:54Z","timestamp":1755785094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i3p36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/13205","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"article-number":"P3.36"}}