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.

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．