List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
List -Edge-Coloring.pdf (175.7Kb)Abstract
We prove that the list chromatic index of a graph of maximum degree Delta and treewidth <= root 2 Delta -3 is Delta; and that the total chromatic number of a graph of maximum degree and treewidth <= Delta/3+1 is Delta+1. This improves results by Meeks and Scott.
General note
Artículo de publicación ISI
Patrocinador
Fondation Sciences Mathematiques de Paris
11090141
Fondecyt
1140766
Quote Item
Journal of Graph Theory Volumen: 81 Número: 3 Páginas: 272-282 (2016)
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile