A note on total and list edge-colouring of graphs of tree-width 3
Abstract
It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are (+1)-edge-choosable and ( +2)-total-colourable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.