The chromatic number of a graph is the smallest number of colors needed to color the vertices of the graph so that no two adjacent vertices have the same color.
The chromatic number of a graph is the smallest number of colors needed to color the vertices of the graph so that no two adjacent vertices have the same color.