k-Colorability of P5-free graphs
classification
💻 cs.DM
cs.DS
keywords
algorithmp5-freecoloringdeterminesexistsfixedgraphgraphs
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.