G. J. Woeginger and J. Sgall, “The complexity of coloring graphs without long induced paths”, Acta Cybern, vol. 15, no. 1, pp. 107-117, Jan. 2001.