图论第六章.pptVIP

Graph Theory * Kuratowski’s Theorem6.2.2 A graph is planar if and only if it does not contain a subdivision of K5 or K3,3 Graph Theory * Lemma 6.2.4 If F is the edge set of a face in a planar embedding of G, then G has an embedding with F being the edge set of the unbounded face Graph Theory * Planarity test Successively add paths from current fragments to check if the graph can be drawn without crossing. Graph Theory * Five Color Theorem Heawood[1890] Every planer graph is 5–colorable. Graph Theory * Theorem Appel-Haken-Koch[1977] 6.3.6 Every planar graph is 4-colorable. The proof used conf