 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.

Slides:



Advertisements
Similar presentations
Chapter 8 Topics in Graph Theory
Advertisements

Chapter 9 Graphs.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.
Planar / Non-Planar Graphs Gabriel Laden CS146 – Spring 2004 Dr. Sin-Min Lee.
Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
GSM MOBILE PHONE NETWORKS AND GRAPH COLORING
Applied Combinatorics, 4th Ed. Alan Tucker
Computational Geometry Seminar Lecture 1
Graph Colouring Lecture 20: Nov 25.
2.2 Hamilton Circuits Hamilton Circuits Hamilton Paths Tucker, Applied Combinatorics, Section 2.2, Tamsen Hunter.
Graph Theory Ch.5. Coloring of Graphs 1 Chapter 5 Coloring of Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 6, Friday, September 12.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 9.8 Graph Coloring
CS 2813 Discrete Structures
9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.
9.2 Graph Terminology and Special Types Graphs
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
CS 200 Algorithms and Data Structures
The Tutte Polynomial Graph Polynomials winter 05/06.
V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Planar Graphs Graph Coloring
Chapter 10.8 Graph Coloring
CSE, IIT KGP Graph Coloring. CSE, IIT KGP K-coloring A k-coloring of G is a labeling f:V(G)  {1,…,k}.A k-coloring of G is a labeling f:V(G)  {1,…,k}.
Chapter 5 Graphs  the puzzle of the seven bridge in the Königsberg,  on the Pregel.
Graph.
Unit – V Graph theory. Representation of Graphs Graph G (V, E,  ) V Set of vertices ESet of edges  Function that assigns vertices {v, w} to each edge.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Graph Theory and Applications
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
Chap. 11 Graph Theory and Applications 1. Directed Graph 2.
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Introduction to Graph Theory
Chapter 10.8 Graph Coloring These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7 th ed., by Kenneth.
COMPSCI 102 Introduction to Discrete Mathematics.
Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]
Outline 1 Properties of Planar Graphs 5/4/2018.
Discrete Mathematics Graph: Planar Graph Yuan Luo
5.9.2 Characterizations of Planar Graphs
Applied Combinatorics, 4th Ed. Alan Tucker
Graph theory Definitions Trees, cycles, directed graphs.
Tucker, Applied Combinatorics, Sec 2.4
Chapter 10.8 Graph Coloring
Coloring Graphs This handout: Coloring maps and graphs
G-v, or G-{v} When we remove a vertex v from a graph, we must remove all edges incident with the vertex v. When a edge is removed from a graph, without.
Discrete Math II Howon Kim
Connectivity Section 10.4.
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
Allocating time to Instructors
Applied Combinatorics, 4th Ed. Alan Tucker
Theorem 5.13: For vT‘, l’(v)= min{l(v), l(vk)+w(vk, v)}
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 10.8 Graph Coloring
N(S) ={vV|uS,{u,v}E(G)}
Discrete Mathematics for Computer Science
GRAPH THEORY Properties of Planar Graphs Ch9-1.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
GRAPH THEORY Properties of Planar Graphs Ch9-1.
Presentation transcript:

 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called a map, If the graph has not any bridge.  Definition 47: A proper region coloring of a map G is an assignment of colors to the region of G, one color to each region, such that adjacent regions receive different colors. An proper region coloring in which k colors are used is a k-region coloring. A map G is k-region colorable if there exists an s- coloring of G for some s  k. The minimum integer k for which G is k- region colorable is called the region chromatic number. We denoted by  *(G). If  *(G) = k, then G is k-region chromatic.

 Four Colour Conjecture Every map (plane graph) is 4-region colourable.  Definition 48 : Let G be a connected plane graph. Construct a dual G d as follows:  1)Place a vertex in each region of G; this forms the vertex set of G d.  2)Join two vertices of G d by an edge for each edge common to the boundaries of the two corresponding regions of G.  3)Add a loop at a vertex v of G d for each bridge that belongs to the corresponding region of G. Moreover, each edge of G d is drawn to cross the associated edge of G, but no other edge of G or G d.

 Theorem 5.31 Every planar graph with no loop is 4-colourable if and only if its dual is 4-region colourable.

 3. Edge colorings  Definition 49:An proper edge coloring of a graph G is an assignment of colors to the edges of G, one color to each edge, such that adjacent edges receive different colors. An edge coloring in which k colors are used is a k-edge coloring. A graph G is k-edge colorable if there exists an s-edge coloring of G for some s  k. The minimum integer k for which G is k-edge colorable is called the edge chromaticumber or the chromatic index  ’(G) of G. If  ’(G) = k, then G is k-edge chromatic.

 4. Chromatic polynomials  Definition 50: Let G =(V, E) be a simple graph. We let P G (k) denote the number of ways of proper coloring the vertices of G with k colors. P G will be called the chromatic function of G.  Example For the graph G P G (k) =k (k-1) 2

 If G = (V, E ) with |V | = n and E = , then G consists of n isolated points, and by the product rule P G (k ) = k n.  If G =K n, the complete graph on n vertices, then at least n colors must be available for a proper coloring of G. Here, by the product rule  P G (k ) = k (k-1)(k-2)...(k-n + 1).  We see that for k < n, P G (k ) = 0, which indicates there is no proper k -coloring of K n

 Let G = (V, E ) be a simple connected graph. For e = {a, b}  E, let G e denote the subgraph of G obtained by deleting e from G, without removing the vertices a and b. Let G e be the quotient graph of G obtained by merging the end points of e.  Example: Figure below shows the graphs G e and G e for the graph G with the edge e as specified.

 Theorem 5.32 Decomposition Theorem for Chromatic Polynomials ( 色多项式分解定理 ) : If G = (V, E) is a connected graph and e  E, then  P G (k) =P Ge (k)-P G e (k)

 Suppose that a graph is not connected and G 1 and G 2 are two components of G.  Theorem 5.33: If G is a disconnected graph with G 1,G 2,…G w, then P G (k)=P G 1 (k)P G 2 (k)…P G w (k).

Chapter 6 Abstract algebra  Groups   Rings   Field   Lattics and Boolean algebra  Next:Abstract algebra, Operations on the set 9.1, P344 (Sixth) OR P330 (Fifth)  Semigroups,monoids and groups 9.2 P349 (Sixth) OR P341 (Fifth),9.4 P362 (Sixth) OR p347 (Fifth)

 Exercise: P338 (Sixth) OR 324(Fifth) 14,15,26,27  2.In figure 1, find these values  (G),  *(G),  ’(G).   figure 1