List edge-colouring and total colouring in graphs of low treewidth

We prove that the list chromatic index of a graph of maximum degree $\mathrm{\Delta }$ and treewidth $\le \sqrt{2\mathrm{\Delta }}-3$ is $\mathrm{\Delta }$; and that the total chromatic number of a graph of maximum degree $\mathrm{\Delta }$ and treewidth $\leq \Delta/3 +1$is$\Delta +1$. This improves results by Meeks and Scott.