Some new hereditary classes where graph coloring remains NP-hard

The graph coloring problem is image-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 image-hard when restricted to it.