Treewidth is NP-Complete on Cubic Graphs (and related results)
Computational Complexity
2023-03-03 v2 Data Structures and Algorithms
Combinatorics
Abstract
In this paper, we give a very simple proof that Treewidth is NP-complete; this proof also shows NP-completeness on the class of co-bipartite graphs. We then improve the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9, by showing that Treewidth is NP-complete on cubic graphs.
Cite
@article{arxiv.2301.10031,
title = {Treewidth is NP-Complete on Cubic Graphs (and related results)},
author = {Hans L. Bodlaender and Édouard Bonnet and Lars Jaffke and Dušan Knop and Paloma T. Lima and Martin Milanič and Sebastian Ordyniak and Sukanya Pandey and Ondřej Suchý},
journal= {arXiv preprint arXiv:2301.10031},
year = {2023}
}