DMA_9.8_流量问题.pptVIP

Graph Theory Rosen 6th ed., ch. 9 Coloring graphs Chromatic number of G Chromatic polynomial of G 图的着色应用与对偶图 定义1： 简单图的着色/coloring 定理1 四色定理/four color theorem four colorsConjecture - 四色猜想 Four colors are always enough to color any map drawn on a plane This conjecture was proved to be true in 1976 with the aid of computer computations performed on almost 2,000 configurations of graphs. There is still no proof known that does not depend on computer checking. map-coloring problem Of the many problems that can be viewed as graph-coloring problems, one of the oldest is the map-coloring problem.(地图着色问题) Coloring graphs Suppose that G = (V, E, ?) is a graph with no multiple edges, and C = {c1, c2, …, cn} is any set of n “colors”. Any function f: V ? C is called a coloring of the graph G using n colors (or using the colors of C). For each vertex v, f(v) is the color of v. ?(G) A coloring is proper (合适的) if any two adjacent vertices v and u have different colors. The smallest number of colors needed to produce a proper coloring of a graph G is called the chromatic number of G(G的着色数), denoted by ?(G). Example 1 ?(G) = 3 Coloring vertex or edge? Given a map M, construct a graph GM Vertex u ? region Ru Edge (u, v) ? regions Ru and Rv share a common boundary. Appel-Haken Four-Color Theorem [1976] The vertices of any planar graph can be 4-colored in such a way that no two adjacent vertices receive the same color. Five Color Theorem Any planar graph can be colored with five colors. Lemma Every Planar Graph Contains a Node of Degree · 5 Proof If every node has degree at least 6, then the number of edges would be 3n, which would contradict our upper bound of 3n-6 edges in an n-node planar graph. Proof of 5-color theorem Let G be a node-minimal counter-example to the theorem, i.e., a planar graph that requires 6 colors. By Lemma, G must have a node q with degree · 5. Let the nodes adjacent to q be named v1, v2, v3, v4, and v5. Proof of 5-color theorem v1, v2, v3, v4, v5 can’t form