给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题-given no vector graph G vertices and m different colors. Using these color graph G of the vertex, each vertex is a color. Whether there is a colored graph G will make every edge of the peak with two different colors. The problem is the map can be colored m to the problem of finding the set-vector graph G vertices and m different colors. Using these color graph G of the vertex, each vertex is a color. Whether there is a colored graph G will make every edge of the peak with two different colors. The problem is the map can be colored m Judgment