[1]
Bodlaender, H., Bonnet, Édouard, Jaffke, L., Knop, D., Lima, P., Milanič, M., Ordyniak, S., Pandey, S. and Suchý, O. 2025. Treewidth is NP-Complete on Cubic Graphs. The Electronic Journal of Combinatorics. 32, 3 (Aug. 2025), P3.36. DOI:https://doi.org/10.37236/13205.