| Naslov: | Excluding an induced wheel minor in graphs without large induced stars |
|---|
| Avtorji: | ID Choi, Mujin (Avtor)
ID Hilaire, Claire (Avtor)
ID Milanič, Martin (Avtor)
ID Wiederrecht, Sebastian (Avtor) |
|---|
| Datoteke: |  https://arxiv.org/abs/2506.08829
https://link.springer.com/chapter/10.1007/978-3-032-11835-6_10
 RAZ_Choi_Mujin_2026.pdf (410,19 KB, Vsebina bo dosegljiva po 01.01.2027)
MD5: 5A6F5D1AE81D14AF440B21DD35847C71
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: | FAMNIT - Fakulteta za matematiko, naravoslovje in informacijske tehnologije
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | induced minor, wheel, tree-independence number, Maximum Independent Set |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | Str. 135-148 |
|---|
| PID: | 20.500.12556/RUP-22851  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 0302-9743 |
|---|
| DOI: | 10.1007/978-3-032-11835-6_10 |
|---|
| COBISS.SI-ID: | 272882435 |
|---|
| Datum objave v RUP: | 25.03.2026 |
|---|
| Število ogledov: | 80 |
|---|
| Število prenosov: | 2 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
