On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7
Lang, Richard
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.