Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
<|reference_start|>Polynomial-time algorithm for vertex k-colorability of P_5-free graphs: We give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results.<|reference_end|>
@article{kaminski2006polynomial-time,
    title={Polynomial-time algorithm for vertex k-colorability of P_5-free graphs},
    author={Marcin Kaminski and Vadim Lozin},
    journal={arXiv preprint arXiv:cs/0607115},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0607115},
    primaryClass={cs.DM cs.DS}
}