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%2F23%3A00371865" target="_blank" >RIV/68407700:21240/23:00371865 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.IPEC.2023.7" target="_blank" >https://doi.org/10.4230/LIPIcs.IPEC.2023.7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2023.7" target="_blank" >10.4230/LIPIcs.IPEC.2023.7</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 subcubic induced subgraphs of the infinite 3-dimensional grid.
Czech name
—
Czech description
—

Type
D - Article in proceedings
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/GA22-19557S" target="_blank" >GA22-19557S: New Frontiers in Computational Social Choice</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Article name in the collection
Proceedings of the 18th International Symposium on Parameterized and Exact Computation
ISBN
978-3-95977-305-8
ISSN
1868-8969
e-ISSN
—
Number of pages
13
Pages from-to
"7:1"-"7:13"
Publisher name
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl
Event location
Amsterdam
Event date
Sep 6, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)