Lupa

Show document Help

A- | A+ | Print
Title:Excluding an induced wheel minor in graphs without large induced stars
Authors:ID Choi, Mujin (Author)
ID Hilaire, Claire (Author)
ID Milanič, Martin (Author)
ID Wiederrecht, Sebastian (Author)
Files:URL https://arxiv.org/abs/2506.08829
 
URL https://link.springer.com/chapter/10.1007/978-3-032-11835-6_10
 
.pdf RAZ_Choi_Mujin_2026.pdf (410,19 KB, This file will be accessible after 01.01.2027)
MD5: 5A6F5D1AE81D14AF440B21DD35847C71
 
Language:English
Work type:Unknown
Typology:1.08 - Published Scientific Conference Contribution
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract:We study a conjecture due to Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht stating that for any positive integer d and any planar graph H, the class of all K_{1,d}-free graphs without H as an induced minor has bounded tree-independence number. A k-wheel is the graph obtained from a cycle of length k by adding a vertex adjacent to all vertices of the cycle. We show that the conjecture of Dallard et al. is true when H is a k-wheel for any k at least 3. Our proof uses a generalization of the concept of brambles to tree-independence number. As a consequence of our main result, several important NP-hard problems such as Maximum Independent Set are tractable on K_{1,d}-free graphs without large induced wheel minors. Moreover, for fixed d and k, we provide a polynomial-time algorithm that, given a K_{1,d}-free graph G as input, finds an induced minor model of a k-wheel in G if one exists.
Keywords:induced minor, wheel, tree-independence number, Maximum Independent Set
Publication version:Version of Record
Year of publishing:2026
Number of pages:Str. 135-148
PID:20.500.12556/RUP-22851 This link opens in a new window
UDC:519.17
ISSN on article:0302-9743
DOI:10.1007/978-3-032-11835-6_10 This link opens in a new window
COBISS.SI-ID:272882435 This link opens in a new window
Publication date in RUP:25.03.2026
Views:73
Downloads:2
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 proceedings

Title:Graph-theoretic concepts in computer science
COBISS.SI-ID:272877059 This link opens in a new window

Record is a part of a journal

Title:Lecture notes in computer science
Shortened title:Lect. notes comput. sci.
Publisher:Springer
ISSN:0302-9743
COBISS.SI-ID:4292374 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-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

Secondary language

Language:Slovenian
Abstract:V prispevku preučujemo domnevo Dallarda, Krnca, Kwona, Milaniča, Munara, Štorgla in Wiederrechta, ki trdi, da ima za poljubno pozitivno celo število d in poljuben ravninski graf H razred vseh grafov brez inducirane zvezde K_{1,d} in brez induciranega minorja izomorfnega grafu H omejeno drevesno neodvisnostno število. Za celo število k vsaj 3 je k-kolo graf, ki ga dobimo iz cikla dolžine k z dodajanjem točke, ki sosednja vsem točkam cikla. Pokažemo, da domneva Dallarda idr. velja za primer, ko je H k-kolo za poljubno celo število k vsaj 3. Naš dokaz uporablja posplošitev koncepta trnjevja (ang. bramble) na drevesno neodvisnostno število. Posledica našega glavnega rezultata je, da je več pomembnih NP-težkih problemov, kot je največja neodvisna množica, polinomsko rešljivih na grafih brez inducirane fiksne zvezde in brez induciranih minorjev, izomorfnih nekemu fiksnemu kolesu. Poleg tega za fiksna d in k razvijemo polinomski algoritem, ki ob danem vhodnem grafu G brez inducirane zvezde K_{1,d} poišče model induciranega minorja za k-kolo v grafu G, če ta obstaja.
Keywords:induciran minor, kolo, drevesno neodvisnostno število, problem največje neodvisne množice


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