Description: 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.
- [Mcoloring] - retroactive law m coloring problems, boo
File list (Check if you may need any files):
color1\color1.cpp
......\color1.dsp
......\color1.dsw
......\color1.ncb
......\color1.opt
......\color1.plg
......\ReadMe.txt
......\StdAfx.cpp
......\StdAfx.h
......\Text1.txt
......\Text2.txt
......\Debug
color1
Download