Definition:Chromatic Number

The chromatic number of a graph $$G$$ is the smallest positive integer $$k$$ such that there exists a proper vertex $k$-coloring of $$G$$.