[1]
Woeginger, G.J. and Sgall, J. 2001. The complexity of coloring graphs without long induced paths. Acta Cybernetica. 15, 1 (Jan. 2001), 107-117.