A note on total and list edge-colouring of graphs of tree-width 3

Abstract

It is shown that Halin graphs are $\Delta$-edge-choosable and that graphs of tree-width 3 are $(\Delta +1)$-edge-choosable and $(\Delta +2)$-total-colourable.

arXiv admin note: substantial text overlap with arXiv:1504.02122