Fixed-parameter tractability of \((n-k)\) list coloring
From MaRDI portal
Publication:5919471
DOI10.1007/978-3-030-25005-8_6zbMath1464.68129MaRDI QIDQ5919471
Venkatesh Raman, Aritra Banik, Vijay Kumar Paliwal, Ashwin Jacob
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
05C15: Coloring of graphs and hypergraphs
68Q27: Parameterized complexity, tractability and kernelization