Graph coloring


In graph theory, graph coloring is an assignment of "colors", (red, blue and so on, but consecutive integers starting from 1 can be used without loss of generality), to certain objects in a graph. Such objects can be vertices, edges, faces, or a mixture of those.