Graph coloring problem concept

Given an undirected connected graph G=(V, E), where V is the set of vertices {1, 2, …, n}, and E is the set of edges. The problem of graph coloring is to use K colors to color the vertices of the graph, and each vertex is colored with one color. The two vertices connected to each edge of G are required to have different colors.