图的m着色问题。 给定无向连通图G和m种不同颜色，用这些颜色为G的各顶点着色，是否有一种着色法使其中每条边两个顶点不同色。

Java实现。-Figure m-coloring problem. A given undirected graph G and m different colors, use these colors to the vertices of G, coloring, whether there is a coloring where each edge to two vertices of different colors. Java.