Coloring of a Graph

$k$-colorable Graph

A graph $G$ is $k$-colorable if we can assign one of $k$ colors to each vertex so that no edge joins two vertices of the same color.