Treewidth is NP-Complete on Cubic Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00386742" target="_blank" >RIV/68407700:21240/25:00386742 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.37236/13205" target="_blank" >https://doi.org/10.37236/13205</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37236/13205" target="_blank" >10.37236/13205</a>

Result language
angličtina
Original language name
Treewidth is NP-Complete on Cubic Graphs
Original language description
In this paper, we show that TREEWIDTH is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that TREEWIDTH is NP-complete on graphs with maximum degree at most 9. We add a new and simpler proof of the NP-completeness of treewidth, and show that TREEWIDTH remains NP-complete on sub cubic induced subgraphs of the infinite 3-dimensional grid, and on cubic line graphs.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)