地图涂色(国外英语资料).docVIP

地图涂色(国外英语资料) The classical algorithm (7) - graph coloring and graph coloring concepts given a graph G and m0 colors, only the use of the m in the color of the node coloring of G case, whether can make any two nodes in the adjacent graph has a different color? This problem called m- coloring decision problem. In m-, the coloring optimization problem is to find the smallest integer m of the graph G coloring. This integer is called the chromatic number of the graph G. The study of graph coloring begins with a famous example of the M - coloring problem -- the four-color problem. This problem requires that all regions of any map on a plane or sphere can be colored at most four colors, and that any two adjacent regions having a common boundary do not have the same color. This problem can be converted to a 4 - color decision problem for a planar graph (a graph is a graph that can be drawn on the plane without any cross at the edges). Each area of a map becomes a node, and if the two regions are adjacent, the corresponding nodes are connected by one edge. Figure 46.1 shows a map with 5 regions and a map corresponding to the map. For many years, although 5 colors have been shown to be sufficient to map any map, it has been unable to find a map that requires more than 4 colors. Until 1976 this problem by aipur (k.i.apple), hecken (w.haken) and Causey (j.koch) can be solved by using electronic computer help. They proved that the 4 colors were enough to stain any map. In this section, not only the maps produced by the map, but all the maps, are considered. Discuss all different ways of coloring a given graph at the most use of M colors. Suppose that the adjacency matrix graPh (1:n, 1:n) is used to represent a graph G, where if (I, J) is an edge of G, then graPh (I, J) =true, or graPh (I, J) =false is not brushed. Since the proposed algorithm cares only about whether an edge exists, the Boolean value is used. Color with integer 1, 2,... M means that the solution uses the N - tu