On the Parameterized Complexity of k-Edge Colouring

MaRDI QIDQ6312102zbMATH OpenFDO

Authors Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

Publication date 7 January 2019

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

This page was built for publication: On the Parameterized Complexity of $k$-Edge Colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6312102)