List edge-coloring and total coloring in graphs of low treewidth (Q2800543)
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: List edge-coloring and total coloring in graphs of low treewidth |
scientific article; zbMATH DE number 6569677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List edge-coloring and total coloring in graphs of low treewidth |
scientific article; zbMATH DE number 6569677 |
Statements
15 April 2016
0 references
list colouring
0 references
total colouring
0 references
tree width
0 references
List edge-coloring and total coloring in graphs of low treewidth (English)
0 references
The authors prove that if a graph has a low treewidth constrast to its maximum degree, then its list chromatic index is equal to the maximum degree and its total chromatic number is equal to the maximum degree plus 1. The result improves the known result of \textit{K. Meeks} and \textit{A. Scott} [``The parameterised complexity of list problems on graphs of bounded treewidth'', Preprint, \url{arXiv:1110.4077}].
0 references
0.8459076285362244
0 references
0.8328655362129211
0 references
0.8314623832702637
0 references
0.8249572515487671
0 references
0.8219529986381531
0 references
