List Edge-Coloring and Total Coloring in Graphs of Low Treewidth

Abstract

We prove that the list chromatic index of a graph of maximum degree Delta and treewidth <= root 2 Delta -3 is Delta; and that the total chromatic number of a graph of maximum degree and treewidth <= Delta/3+1 is Delta+1. This improves results by Meeks and Scott.