Chromatic index, treewidth and maximum degree

Abstract

We conjecture that any graph G with treewidth k and maximum degreeIn support of the conjecture we prove its fractional version. We also show that any graph G with treewidth k ≥ 4 and maximum degree 2k − 1 satisfies χ ′ (G) = ∆(G), extending an old result of Vizing.