The EXPLANATION is: The chromatic number of a graph is the MINIMAL number of COLORS for which a graph coloring is possible. A graph G is termed as K-colorable if there EXISTS a graph coloring on G with k colors. If a graph is k-colorable, then it is n-colorable for any n>k.