List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
Author
dc.contributor.author
Bruhn, Henning
Author
dc.contributor.author
Lang, Richard
Author
dc.contributor.author
Stein, Maya
Admission date
dc.date.accessioned
2016-05-18T17:01:54Z
Available date
dc.date.available
2016-05-18T17:01:54Z
Publication date
dc.date.issued
2016
Cita de ítem
dc.identifier.citation
Journal of Graph Theory Volumen: 81 Número: 3 Páginas: 272-282 (2016)
en_US
Identifier
dc.identifier.other
DOI: 10.1002/jgt.21874
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/138363
General note
dc.description
Artículo de publicación ISI
en_US
Abstract
dc.description.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.
en_US
Patrocinador
dc.description.sponsorship
Fondation Sciences Mathematiques de Paris
11090141
Fondecyt
1140766