"Treewidth is NP-Complete on Cubic Graphs."

Hans L. Bodlaender et al. (2025)

> Home

Details and statistics

DOI: 10.37236/13205

access: open

type: Journal Article

metadata version: 2025-12-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/combinatorics/BodlaenderBJKLMOPS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/BodlaenderBJKLMOPS25
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs. Electron. J. Comb. 32(3) (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.