I want to delete a given number M of vertexes (with adjacent edges) of a given graph G with N vertexes to split the remaining graph G' into minimal number of independent sets. Or, alternatively, to color it with a min number of colors. Graphs are sparse and huge, M is much less then N.