arXiv Analytics

Sign in

arXiv:1504.02122 [math.CO]AbstractReferencesReviewsResources

On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7

Richard Lang

Published 2015-04-08Version 1

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.

Categories: math.CO
Subjects: 05C15, G.2.2
Related articles: Most relevant | Search more
arXiv:1206.3862 [math.CO] (Published 2012-06-18, updated 2018-11-18)
Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles
arXiv:1705.00484 [math.CO] (Published 2017-05-01)
Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs
arXiv:0912.4770 [math.CO] (Published 2009-12-24, updated 2011-03-08)
Every plane graph of maximum degree 8 has an edge-face 9-colouring

Links

Toolbox