Gerhard J. Woeginger and Jirí Sgall. The complexity of coloring graphs without long induced paths. Acta Cybernetica, 15(1):107-117, 2001. [ PDF ]
This document was translated from BibTEX by bibtex2html