Artículo de revista
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
Fecha
2016Registro en:
Graphs and Combinatorics (2016) 32:1055–1064
DOI: 10.1007/s00373-015-1617-3
Autor
Lang, Richard
Institución
Resumen
It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are -edge-choosable and -total-colourable.