Treewidth is NP-Complete for Cubic Graphs (and related results)
Résumé
In this paper, we give a very simple proof that Treewidth is NP-complete; this proof also shows NP-completeness for the class of co-bipartite graphs. We then improve the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete for graphs with maximum degree at most 9, by showing that Treewidth is NP-complete for cubic graphs.
Fichier principal
NP_completeness_for_Bounded_Degree_Treewidth.pdf (488.76 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|