On the Parameterized Complexity of $k$-Edge Colouring

Bernard Ries; Dani\"el Paulusma; Esther Galby; Paloma T. Lima

arxiv: 1901.01861 · v4 · pith:FE66CN3Vnew · submitted 2019-01-07 · 💻 cs.DM · cs.CC· cs.DS· math.CO

On the Parameterized Complexity of k-Edge Colouring

Esther Galby , Paloma T. Lima , Dani\"el Paulusma , Bernard Ries This is my paper

classification 💻 cs.DM cs.CCcs.DSmath.CO

keywords colouringedgeparameterizedcomplexitydegreeeveryfixedfixed-parameter-tractable

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

On the Parameterized Complexity of k-Edge Colouring

discussion (0)