Deciding k-colourability of $P_5$-free graphs in polynomial time
Data Structures and Algorithms
2016-08-14 v1
Abstract
The problem of computing the chromatic number of a -free graph is known to be NP-hard. In contrast to this negative result, we show that determining whether or not a -free graph admits a -colouring, for each fixed number of colours , can be done in polynomial time. If such a colouring exists, our algorithm produces it.
Keywords
Cite
@article{arxiv.cs/0702043,
title = {Deciding k-colourability of $P_5$-free graphs in polynomial time},
author = {Chính T. Hoàng and Marcin Kamiński and Vadim Lozin and J. Sawada and X. Shu},
journal= {arXiv preprint arXiv:cs/0702043},
year = {2016}
}