The complexity of coloring graphs without long induced paths

Gerhard J. Woeginger, Jiri Sgall. The complexity of coloring graphs without long induced paths. Acta Cybern., 15(1):107, 2001. [doi]

Abstract

Abstract is missing.