A note on total and list edge-colouring of graphs of tree-width 3
Combinatorics
2015-07-30 v2
Abstract
It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are -edge-choosable and -total-colourable.
Keywords
Cite
@article{arxiv.1504.05252,
title = {A note on total and list edge-colouring of graphs of tree-width 3},
author = {Richard Lang},
journal= {arXiv preprint arXiv:1504.05252},
year = {2015}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1504.02122