Harmonious coloring: parameterized algorithms and upper bounds

DOI10.1016/j.tcs.2018.12.011zbMath1421.68136MaRDI QIDQ2632021

Venkatesh Raman, Fahad Panolan, Sudeshna Kolay, Prafullkumar Tale, Ragukumar Pandurangan

Publication date: 17 May 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.12.011

zbMATH Keywords

upper bounds; fixed parameter tractability; split graphs; vertex cover; harmonious coloring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)