A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree (Q6520680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree |
scientific article from arXiv |
Statements
A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree (English)
0 references
