Bodlaender, Hans, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, and Ondřej Suchý. “Treewidth Is NP-Complete on Cubic Graphs”. The Electronic Journal of Combinatorics 32, no. 3 (August 22, 2025): P3.36. Accessed March 30, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i3p36.