Description: 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
To Search:
File list (Check if you may need any files):
Download