On the Parameterized Complexity of $k$-Edge Colouring

Abstract

For every fixed integer $k\ge 1$, we prove that $k$-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.