Keyword: Chromatic

The chromatic number of a graph G is the minimum number of different colors required to color the vertices of G such that two adjacent vertices have different colors.