Treewidth is NP-Complete on Cubic Graphs

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

Metadata

Item Type: Article
Authors/Creators:
Dates:
  • Accepted: 7 May 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
Depositing User: Symplectic Publications
Date Deposited: 30 May 2025 09:54
Last Modified: 30 May 2025 09:54
Status: In Press
Publisher: Electronic Journal of Combinatorics
Open Archives Initiative ID (OAI ID):

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics


CORE (COnnecting REpositories)