2019/01/07 by Galby, Esther, Lima, Paloma T., Paulusma, Daniël +1
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1901.01861
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.