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