the a coloring of the graph means assigning each of its vertices a color such that no pair of vertices connected by an edge have the same color in general, this is a very hard problem, e.g.