Abstract
The complexity of the coloring problem is known for all hereditary classes defined by two connected 5-vertex forbidden induced subgraphs except 13 cases. We update this result by proving polynomial-time solvability of the problem for two of the mentioned 13 classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have