Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems

DOI10.1007/978-3-319-57586-5_29zbMath1486.68083arXiv1701.06985MaRDI QIDQ5283380

Bart M. P. Jansen, Lars Jaffke

Publication date: 21 July 2017

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

Full work available at URL: https://arxiv.org/abs/1701.06985

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

68Q27: Parameterized complexity, tractability and kernelization