Sgall, Jirí

Woeginger, Gerhard

English

We discuss the computational complexity of determining the chromatic number of graphs without long induced paths. We prove NP-completeness of deciding whether a Ps-free graph is 5-colorable and of deciding whether a Pi2-free graph is 4-colorable. Moreover, we give a polynomial time algorithm for deciding whether a Ps-free graph is 3-colorable

University of Twente Research Information

The complexity of coloring graphs without long induced paths

https://ris.utwente.nl/ws/files/25289405/cybernetica_015_numb_001_107_117.pdf

The complexity of coloring graphs without long induced paths

Abstract

Similar works

Full text

Available Versions

University of Twente Research Information