On the Parameterized Complexity of $k$-Edge Colouring
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries·2019-01-07·via math.CO updates on arXiv.org
For every fixed integer $k \geq 1$, we prove that $k$-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.