On the Parameterized Complexity of k-Edge Colouring
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.