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.
翻译:在本文中,我们给出了一个非常简单的证据,证明树枝是NP不完整的;这个证据还显示了双边图类中的NP完整性。 然后我们从1997年起改进了Bodlaender和Thilikos的结果,即树枝在图表上是NP完整性的,最大程度最多为9,显示树枝在立方图上是NP完整性的。