k-Colorability of P5-free graphs
<|reference_start|>k-Colorability of P5-free graphs: A polynomial time algorithm that determines for a fixed integer k whether or not a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid k-coloring.<|reference_end|>
@article{hoang2006k-colorability,
    title={k-Colorability of P5-free graphs},
    author={C. T. Hoang, J. Sawada, X. Shu},
    journal={arXiv preprint arXiv:cs/0609083},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0609083},
    primaryClass={cs.DM cs.DS}
}