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