A coloring of a simple graph is the assignment of a color to each vertex of the graph so that no two adjacent vertices are assigned the same color.
The chromatic number of a graph is the least of color needed for a coloring of this graph. The chromatic number of a graph is denoted by .
The Four Color Theorem
The chromatic number of a planar graph is no greater then four.