Proper vertex coloring ($\{u,v\}\in E⟹c(u)\ne c(v)$)

A proper vertex coloring assigns labels to the vertices of a graph so that vertices joined by an edge have different labels. Each colour class is an independent set. The chromatic number is the least number of labels needed for this form of graph coloring.