Abstract

The graph coloring problem is NP -hard in the set of all graphs. In this note we combine two problem reductions to provide a collection of hereditary classes of graphs for which the graph coloring problem remains NP -hard when restricted to it.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call