10.

7
Section

Planar Graphs
Section Summary
Planar graph
Euler’s Formula
Corollaries of Euler’s Formula
(Necessary conditions of planar simple graph)
Kuratowski’s Theorem
Planar graph
Definition: A graph is called planar if it
can be drawn in the plane without any
edges crossing (where a crossing of
edges is the intersection of the lines or
arcs representing them at a point other
than their common endpoint).
Such a drawing is called a planar
representation of the graph.
Planar graph
Planar graph
Planar graph
Planar graph
Planar graph
A planar representation of a graph splits
the plane into regions, including an
unbounded region.
Definition: degree of a region is the
number of edges on the boundary of this
region.
 When an edge occurs twice on the boundary it
contributes two to the degree.
 We denote the degree of a region R by deg(R).
Planar graph
Example: The regions and
their degree of the graph.
APPLICATIONS OF PLANAR
GRAPHS
Planarity of graphs plays an important role in
the design of electronic circuits.
 Print a circuit on a single board with no connections
crossing.
 Partition the vertices in the graph representing the
circuit into planar subgraphs--Construct the circuit using
multiple layers.
--Construct the circuit using insulated wires whenever
connections cross.
The planarity of graphs is also useful in the
design of road networks.
 built this road network without using underpasses or
overpasses if the resulting graph is planar.
Euler’s Formula
EULER’S FORMULA Let G be a connected
planar simple graph with e edges and v
vertices. Let r be the number of regions in
a planar representation of G. Then r = e −
v + 2.
Euler’s Formula
Example: Suppose that a connected planar
simple graph has 20 vertices, each of degree 3.
Into how many regions does a representation of
this planar graph split the plane?
Solution: This graph has 20 vertices, each of
degree 3, so v = 20.
The sum of the degrees of the vertices,
3v = 3 ・ 20 = 60,
Twice the number of edges, 2e, we have
2e = 60, or e = 30.
Consequently, from Euler’s formula, the
number of regions is r = e − v + 2 = 30 − 20 +
2 = 12.
COROLLARY 1
COROLLARY: If G is a connected planar simple
graph with e edges and v vertices, where v ≥ 3,
then e ≤ 3v − 6.
COROLLARY 2
COROLLARY: If G is a connected planar simple graph,
then G has a vertex of degree not exceeding five.
COROLLARY 3
COROLLARY: If a connected planar simple
graph has e edges and v vertices with v ≥ 3
and no circuits of length 3, then e ≤ 2v − 4.
COROLLARY 3
Kuratowski’s Theorem
Definition: If a graph is planar, so will be any graph
obtained by removing an edge {u, v} and adding a
new vertex w together with edges {u,w} and {w, v}.
Such an operation is called an elementary
subdivision.
The graphs G1 = (V1,E1) and G2 = (V2,E2) are called
homeomorphic if they can be obtained from the same
graph by a sequence of elementary subdivisions.
Kuratowski’s Theorem
Kuratowski’s Theorem
Example: Is the Petersen graph, shown
in Figure, planar?
Kuratowski’s Theorem
10.8
Section

Graph Coloring
Section Summary
Introduction
THE FOUR COLORTHEOREM
Coloring of a simple graph
Applications of Graph Colorings
Introduction
Consider the problem of determining
the least number of colors that can be
used to color a map so that adjacent
regions never have the same color.
The problem of coloring the regions of a
map is equivalent to the problem of
coloring the vertices of the dual graph
so that no two adjacent vertices in this
graph have the same color.
dual graph
The dual graph of the map is set up in
the following way:
1. each region of the map is represented
by a vertex.
2. Edges connect two vertices if the
regions represented by these vertices
have a common border.
3. Two regions that touch at only one point
are not considered adjacent.
dual graph
Example: Give the dual graph of the figure.
dual graph
Coloring of a simple graph
Definition: A coloring of a simple graph is
the assignment of a color to each vertex
of the graph so that no two adjacent
vertices are assigned the same color.
Definition: The chromatic number of a
graph is the least number of colors
needed for a coloring of this graph. The
chromatic number of a graph G is denoted
by χ(G). (Here χ is the Greek letter chi.)
Coloring of a simple planar
graph
THE FOUR COLORTHEOREM
The chromatic number of a planar graph
is no greater than four.
The four color theorem was
originally posed as a conjecture
in the 1850s.
It was finally proved by the The most notorious fallacious
American mathematicians proof in all of mathematics is
Kenneth Appel andWolfgang the incorrect proof of the four
Haken in 1976. color theorem published in 1879
by a London barrister and
amateur mathematician,
Alfred Kempe.
Coloring of a simple graph
Example: What are the chromatic numbers of
the graphs G and H shown in Figure?
Coloring of a simple graph
Coloring of a simple graph

A Coloring of K5
Coloring of a simple graph
Coloring of a simple graph
Example: What is the chromatic number of the
graph Cn, where n ≥ 3?
Solution: We have shown that χ(Cn) = 2 if n is an
even positive integer with n ≥ 4 and χ(Cn) = 3 if n
is an odd positive integer with n ≥ 3.
 Two colors are needed to color Cn when n is even. To construct
such a coloring, simply pick a vertex and color it red. Proceed
around the graph in a clockwise direction coloring the second
vertex blue, the third vertex red, and so on. The nth vertex can be
colored blue, because the two vertices adjacent to it, namely the(n
− 1)st and the first vertices, are both colored red.
 When n is odd and n > 1, the chromatic number of Cn is 3. To see
this, pick an initial vertex. To use only two colors, it is necessary to
alternate colors as the graph is traversed in a clockwise direction.
However, the nth vertex reached is adjacent to two vertices of
different colors, namely, the first and (n − 1)st. Hence, a third
color must be used.
Coloring of a simple graph
Applications of Graph
Colorings
Scheduling Final Exams
How can the final exams at a university be
scheduled so that no student has two
exams at the same time?
Frequency Assignments
Television channels 2 through 13 are
assigned to stations in North America so
that no two stations within 150 miles can
operate on the same channel. How can
the assignment of channels be modeled
by graph coloring?