Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation

DOI10.1007/978-3-642-54423-1_36zbMath1405.68241arXiv1212.4129MaRDI QIDQ5405060

Danupon Nanongkai, Bundit Laekhanukit, Parinya Chalermsook

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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)

05C76: Graph operations (line graphs, products, etc.)