A note on total and list edge-colouring of graphs of tree-width 3
classification
🧮 math.CO
keywords
deltagraphsedge-choosabletree-widthedge-colouringhalinlistnote
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.