On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7
classification
🧮 math.CO
keywords
degreedeltaedge-choosablegraphsleastmaximumtree-widthchromatic
read the original abstract
Among other results, it is shown that 3-trees are $\Delta$-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are $\Delta$-edge-choosable.
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.