Approximations for -Colorings of Graphs

DOI10.1093/comjnl/47.2.193zbMath1039.68090MaRDI QIDQ4470433

Ton Kloks, Richard B. Tan, Hans L. Bodlaender, Jan van Leeuwen

Publication date: 1 July 2004

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/47.2.193

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)