Polynomial-time algorithm for vertex k-colorability of P₅-free graphs
classification
💻 cs.DM
cs.DS
keywords
algorithmfreegraphspolynomial-timecoloringcolorsfirstgeneralizes
read the original abstract
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.
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.