给定无向连通图G和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点

着一种颜色。是否有一种着色法使G中每条边的2个顶点着不同颜色。这个问题是

图的m可着色判定问题。若一个图最少需要m种颜色才能使图中每条边连接的2个

顶点着不同颜色，则称这个数m为该图的色数。求一个图的色数m的问题称为图的

m可着色优化问题。

-Given an undirected connected graph G, and m kinds of different colors. With these colors for the map G, the vertex shading, each vertex



With a color. Is there a shading to G, each edge two vertices with different colors. The problem is



M can be determined graph coloring problem. If a plan requires a minimum of m kinds of color can make graph each edge connecting two



Vertices with different colors, claimed that the number of m for the chromatic number of graphs. Seeking a graph called the chromatic number of graph problems m



m can be colored optimization problem.