On the parameterized complexity of happy vertex coloring

DOI10.1007/978-3-319-78825-8_9zbMath1454.68087MaRDI QIDQ1642688

Akanksha Agrawal

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_9

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization