Chromatic index, treewidth and maximum degree

We conjecture that any graph G with treewidth k and maximum degree Δ(G)≥k+k satisfies χ′(G)=Δ(G). In support of the conjecture we prove its fractional version.