Treewidth is NP-Complete on Cubic Graphs

Bodlaender, H., Bonnet, E., Jaffke, L. et al. (6 more authors) (2025) Treewidth is NP-Complete on Cubic Graphs. The Electronic Journal of Combinatorics, 32 (3). P3.36. ISSN: 1077-8926

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© The authors. This is an open access article under the terms of the Creative Commons Attribution License (CC-BY-ND 4.0).

Dates:
  • Accepted: 7 May 2025
  • Published: 22 August 2025
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/V00252X/1
Date Deposited: 30 May 2025 09:54
Last Modified: 03 Mar 2026 12:57
Status: Published
Publisher: Electronic Journal of Combinatorics
Identification Number: 10.37236/13205
Open Archives Initiative ID (OAI ID):

Export

Statistics