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

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

No reviews yet.

No comments yet.