On the Parameterized Complexity of k-Edge Colouring
For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.
READ FULL TEXTFor every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.
READ FULL TEXT