coloring

Coloring of a graph is its partition where each part is an independent set. Each part is considered to be a color so in a properly colored graph every edge goes between two differently colored vertices.