Treewidth is NP-Complete on Cubic Graphs (and related results)

01/24/2023

∙

by   Hans L. Bodlaender, et al.

∙

0

∙

share

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.