paper

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

arXiv:1504.02122

Abstract

Among other results, it is shown that 3-trees are -edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are -edge-choosable.

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