Abstract
We introduce the graph parameter starwidth. We show results on characterization, complexity and the relation with other parameters. We also discuss the complexity of problems on bounded starwidth graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 9-14 |
| Number of pages | 6 |
| Journal | Information Processing Letters |
| Volume | 125 |
| Issue number | September |
| DOIs | |
| Publication status | Published - 2017 |
Funding
I would like to thank Thomas Bosman, Leo van Iersel and René Sitters for fruitful discussions and feedback. This work was supported by the NWO Grant 612.001.215.
| Funders | Funder number |
|---|---|
| Thomas Bosman | |
| Nederlandse Organisatie voor Wetenschappelijk Onderzoek | 612.001.215 |