Woeginger, Gerhard J., and Jiří Sgall. 2001. “The Complexity of Coloring Graphs Without Long Induced Paths”. Acta Cybernetica 15 (1), 107-17. https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3566.