| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950834 | Information Processing Letters | 2017 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Martijn van Ee,