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

Richard Lang

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.