On the Parameterized Complexity of k-Edge Colouring

01/07/2019
by   Esther Galby, et al.
0

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 TEXT

Please sign up or login with your details

Forgot password? Click here to reset