Fixed-parameter tractability of \((n-k)\) list coloring

DOI10.1007/978-3-030-25005-8_6zbMath1464.68129OpenAlexW2958063902MaRDI QIDQ5919471

Aritra Banik, Vijay Kumar Paliwal, Ashwin Jacob, Venkatesh Raman

Publication date: 25 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_6

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

Parameterizing role coloring on forests ⋮ List-coloring -- parameterizing from triviality ⋮ Fixed-parameter tractability of \((n-k)\) list coloring ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems

This page was built for publication: Fixed-parameter tractability of \((n-k)\) list coloring