The complexity of coloring graphs without long induced paths
AbstractWe discuss the computational complexity of determining the chromatic number of graphs without long induced paths. We prove NP-completeness of deciding whether a P8-free graph is 5-colorable and of deciding whether a P12-free graph is 4-colorable. Moreover, we give a polynomial time algorithm for deciding whether a P5-free graph is 3-colorable.
Download data is not yet available.
How to Cite
Woeginger, G. J., & Sgall, J. (2001). The complexity of coloring graphs without long induced paths. Acta Cybernetica, 15(1), 107-117. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3566