Lupa

Show document Help

A- | A+ | Print
Title:Treewidth is NP-complete on cubic graphs
Authors:ID Bodlaender, Hans L. (Author)
ID Bonnet, Édouard (Author)
ID Jaffke, Lars (Author)
ID Knop, Dušan (Author)
ID Lima, Paloma T. (Author)
ID Milanič, Martin (Author)
ID Ordyniak, Sebastian (Author)
ID Pandey, Sukanya (Author)
ID Suchý, Ondřej (Author)
Files:.pdf RAZ_Bodlaender_Hans_L._2025.pdf (550,69 KB)
MD5: A0B3102D0BCB3B966DE4D86EAB742B51
 
URL https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i3p36
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
Abstract:The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simplicial paths. In 2020, Bonamy, Defrain, Hatzel, and Thiebaut proved that every graph containing an induced path of order k also contains an avoidable induced path of the same order. They also asked whether one could generalize this result to other avoidable structures, leaving the notion of avoidability up to interpretation. In this paper, we address this question: we specify the concept of avoidability for arbitrary graphs equipped with two terminal vertices. We provide both positive and negative results, some of which are related to a recent work by Chudnovsky, Norin, Seymour, and Turcotte in 2024. We also discuss several open questions.
Keywords:treewidth, cubic graph, NP'completeness
Publication version:Version of Record
Publication date:22.08.2025
Year of publishing:2025
Number of pages:str. 1-23
Numbering:Vol. 32, iss. 3, article no. P3.36
PID:20.500.12556/RUP-22238 This link opens in a new window
UDC:519.17
ISSN on article:1077-8926
DOI:10.37236/13205 This link opens in a new window
COBISS.SI-ID:261951235 This link opens in a new window
Publication date in RUP:18.12.2025
Views:127
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Electronic journal of combinatorics
Shortened title:Electron. j. comb.
Publisher:N.J. Calkin and H.S. Wilf
ISSN:1077-8926
COBISS.SI-ID:6973785 This link opens in a new window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:I0-0035-2022
Name:Infrastrukturna skupina Univerze na Primorskem

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0285-2022
Name:Algebra, diskretna matematika, verjetnostni račun in teorija iger

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3001-2021
Name:Terwilligerjeva algebra grafa

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3002-2021
Name:Prirejanja in barvanja povezav v kubičnih grafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3003-2021
Name:Grupe, poseti, in kompleksi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008-2022
Name:Drevesno neodvisnostno število grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4084-2022
Name:Določeni kombinatorični objekti v spektralni domeni - križiščna analiza

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-60012-2025
Name:“Linearne kode preko posebnih razredov funkcij - relacije in načrtovanje

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0370-2024
Name:Onkraj redkosti: razredi grafov in širinski parametri

Funder:Other - Other funder or multiple funders
Project number:0013103
Name:CogniCom

Licences

License:CC BY-ND 4.0, Creative Commons Attribution-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nd/4.0/
Description:Under the NoDerivatives Creative Commons license one can take a work released under this license and re-distribute it, but it cannot be shared with others in adapted form, and credit must be provided to the author.

Secondary language

Language:Slovenian
Keywords:drevesna širina, kubičen graf, NP-polnost


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica