Planar Graphs

EULER PATH AND EULER CIRCUIT
L25
Euler and Hamilton Paths -Motivation

An pictorial way to motivate the graph theoretic concepts of Eulerian and Hamiltonian paths and circuits is with two puzzles: The pencil drawing problem The taxicab problem
L25
Pencil Drawing Problem -Euler Paths

Which of the following pictures can be drawn on paper without ever lifting the pencil and without retracing over any segment?
L25

Graph Theoretically: Which of the following graphs has an Euler path?
L25

Answer: the left but not the right.
1 start 4 5
L25
2 3 6 finish
Euler Paths and Circuits Definition

DEF: An Euler path in a graph G is a simple path containing every edge in G. An Euler circuit (or Euler cycle ) is a cycle which is an Euler path. NOTE: The definition applies both to undirected as well as directed graphs of all types.
L25 6
Hamilton path is a path in an undirected graph that visits each vertex exactly once.
L25
Taxicab Problem -Hamilton Paths

Can a taxicab driver milk his hapless customer by visiting every intersection exactly once, when driving from point A to point B ? A
L25
Taxicab Problem -Hamilton Paths

Graph Theoretically: Is there a Hamilton path from A to B in the following graph? (NO in this case)
A
L25
Hamilton Paths and Circuits Definition

DEF: A Hamilton path in a graph G is a path which visits ever vertex in G exactly once. A Hamilton circuit (or Hamilton cycle ) is a cycle which visits every vertex exactly once, except for the first vertex, which is also visited at the end of the cycle. NOTE: Again, the definition applies both to undirected as well as directed graphs of all types.
L25 10
Implications to CS
Finding Hamilton paths is a very important problem in CS. EG: Visit every city (vertex) in a region using the least trips (edges) as possible. EG: Encode all bit strings of a certain length as economically as possible so that only change one bit at a time. (Gray codes).
L25 11
Implications to CS
Analyzing difficulty of Euler vs. Hamilton paths is a great CS case study. Finding Euler paths can be done in O (n) time Finding Hamilton paths is NPcomplete! Slight change in definition can result in dramatic algorithmic bifurcation!
L25 12
Finding Euler Paths

To find Euler paths, well first give an algorithm for finding Euler cycles and then modify it to give Euler paths. THM: An undirected graph G has an Euler circuit iff it is connected and every vertex has even degree. NOTE: for directed graphs the condition is that G be weakly connected and that every vertex has same in-degree as outdegree.
L25 13
Finding Euler Circuits

Q: Why does the following graph have no Euler circuit?
L25
14
Finding Euler Circuits

A: It contains a vertex of odd degree.
L25
15
Euler Circuit All Degrees Even

2nd half of theorem says that an Euler circuit in a graph implies that all degrees are even: In a simple cycle, whenever path enters vertex, must come out on different edge. Thus every visit of v contributes 2 to deg(v). Thus, if keep only edges which were on the simple cycle, degrees of resulting graph are all even. But in an Eulerian graph G, can find a simple cycle containing all vertices and consequently graph resulting from cycle is G itself!
L25 16
Generalizing to Euler Paths

Q: Does the following have an Euler circuit?
L25
17

A: No, vertices of odd degree:
Q: But why does it have an Euler path?

L25 18

A: YES! Because exactly 2 vertices of odd degree.
So can add a phantom edge between odd degree vertices:

L25 19
All degrees now even so find Euler cycle:

L25 20

1 3 4 2
7
5
Now remove phantom edge obtaining:

L25 21

1 3 4 5 6 2
Generalize:
L25 22

THM: An undirected connected graph has an Euler path iff there are exactly two vertices of odd degree.
L25
23
Blackboard Exercises for 7.5

1) Prove by induction that Qn always has
a Hamilton cycle for n > 1. (This gives a Gray code). 2) Prove that the following graph has no Hamilton cycle:
L25
24
Planar Graphs
Planar graphs are graphs that can be drawn in the plane without edges having to cross. Understanding planar graph is important: Any graph representation of maps/ topographical information is planar.
graph algorithms often specialized to planar graphs (e.g. traveling salesperson)
Circuits usually represented by planar graphs

L25 25
Planar Graphs -Common Misunderstanding

Just because a graph is drawn with edges crossing doesnt mean its not planar. Q: Why cant we conclude that the following is non-planar?
L25
26

A: Because it is isomorphic to a graph which is planar:
L25
27

L25
28

L25
29

L25
30

L25
31

L25
32

L25
33

L25
34

L25
35
Proving Planarity
To prove that a graph is planar amounts to redrawing the edges in a way that no edges will cross. May need to move vertices around and the edges may have to be drawn in a very indirect fashion. E.G. show that the 3-cube is planar:
L25 36
Proving Planarity 3-Cube
L25
37
Proving Planarity? 4-Cube
Seemingly not planar, but how would one prove this!

L25 38
Disproving Planarity
The book gives several methods. Ill describe one method that will always work in examples that youll get on the final. You may also use any of the methods that the book mentions. (One method Kuratowskis theorem in principle always works, though in practice can be quite unwieldy.)
L25 39
Disproving Planarity
The idea is to try to find some invariant quantities possessed by graphs which are constrained to certain values, for planar graphs. Then to show that a graph is non-planar, compute the quantities and show that they do not satisfy the constraints on planar graphs.
L25
40
Regions
The first invariant of a planar graph will be the number of regions that the graph defines in the plane. A region is a part of the plane completely disconnected off from other parts of the plane by the edges of the graph. EG: the car graph has 4 regions:
4
L25
3 1 2
41
Regions
Q: How many regions does the 3-cube have?
L25
42
Regions
A: 6 regions
3 4 1 5 2
L25
43
Regions
THM: The number of regions defined by a connected planar graph is invariant of how it is drawn in the plane and satisfies the formula involving edges and vertices: r = |E | - |V | + 2 EG: Verify formula for car and 3-cube:
4=
L25
6-4+2
3 2
6=12-8+2
3 4 1 5
44
Euler Characteristic
The formula is proved by showing that the quantity (chi) = r - |E | + |V | must equal 2 for planar graphs. is called the Euler characteristic . The idea is that any connected planar graph can be built up from a vertex through a sequence of vertex and edge additions. For example, build 3-cube as follows:
L25 45
L25
46
Thus to prove that is always 2 for planar graphs, one calculate for the trivial vertex graph: = 1-0+1 = 2 and then checks that each possible move does not change .
L25
47
Check that moves dont change : EG: 1) Adding a degree 1 vertex: r is unchanged. |E | increases by 1. |V | increases by 1. += (0-1+1) 2) Adding an edge between pre-existing vertices:
EG:
r increases by 1. |E | increases by 1. |V | unchanged. += (1-1+0)

L25 48
Animated Invariance of Euler Characteristic

|V | 1 |E | 0
r
1
= r - |E | + |V | 2
L25
49

|V | 2 |E | 1
r
1
= r - |E | + |V | 2
L25
50

|V | 3 |E | 2
r
1
= r - |E | + |V | 2
L25
51

|V | 4 |E | 3
r
1
= r - |E | + |V | 2
L25
52

|V | 4 |E | 4
r
2
= r - |E | + |V | 2
L25
53

|V | 5 |E | 5
r
2
= r - |E | + |V | 2
L25
54

|V | 6 |E | 6
r
2
= r - |E | + |V | 2
L25
55

|V | 7 |E | 7
r
2
= r - |E | + |V | 2
L25
56

|V | 8 |E | 8
r
2
= r - |E | + |V | 2
L25
57

|V | 8 |E | 9
r
3
= r - |E | + |V | 2
L25
58

|V | 8 |E | 10
r
4
= r - |E | + |V | 2
L25
59

|V | 8 |E | 11
r
5
= r - |E | + |V | 2
L25
60

|V | 8 |E | 12
r
6
= r - |E | + |V | 2
L25
61
Face-Edge Handshaking
For all graphs handshaking theorem relates degrees of vertices to number of edges. For planar graphs, can relate regions to edges in similar fashion: EG: There are two ways to count the number of edges in 3-cube: 1) Count directly: 12 2) Count no. of edges around each region; divide by 2: (4+4+4+4+4+4)/2 = 12 (2 triangles per edge)
Face-Edge Handshaking
DEF: The degree of a region F is the number of edges at its boundary, and is denoted by deg(F ). THM: Let G be a planar graph with region set R. Then:
1 | E | = deg( F ) 2 FR
L25
63
Girth
The girth of a graph is the length of the smallest simple cycle in the graph. Q: What the girth of each of the following?
L25
64
Girth
A: g=2
g=4
g=4
Q: What the smallest possible girth for L25 simple bipartite graphs?
65
Girth
A: g = 4 is the smallest possible girth: Any cycle must start and end in the same color, so must have even length. Since simple, cannot have a 2-cycle, so 4-cycle is shortest possible.
L25
66
Proving that Q4 is Non-Planar

Now we have enough invariants to prove that the 4-cube is non-planar. 1) Count the number of vertices and edges: |V | = 16 (twice the number for 3-cube) |E | = 32 (twice the number for 3-cube plus number of vertices in 3-cube) 2) Suppose 4-cube were planar so by Eulers formula number of regions would be: r = 32-16+2=18
L25 67
Proving that Q4 is Non-Planar

3) Calculate the girth: g = 4 4) Apply handshaking theorem to get a lower bound on the number of edges, since the degree of each face must be at least as large as the girth:
In our case, this give |E | 184=36 contradicting |E | = 32 ! Thus 4-cube cannot be planar. 68 L25
1 1 1 | E | = deg( F ) g = rg 2 FR 2 FR 2
Blackboard exercises for 7.7

Show that the following graphs are nonplanar: 1) K5
2) K3,3 3) Qn for n 4
L25
69
Graph Coloring
Consider a fictional continent.
L25
70
Map Coloring
Suppose removed all borders but still wanted to see all the countries. 1 color insufficient.
L25
71
Map Coloring
So add another color. Try to fill in every country with one of the two colors.
L25
72
Map Coloring
L25
73
Map Coloring
L25
74
Map Coloring
L25
75
Map Coloring
PROBLEM: Two adjacent countries forced to have same color. Border unseen.
L25
76
Map Coloring
So add another color:
L25
77
Map Coloring
Insufficient. Need 4 colors because of this country.
L25
78
Map Coloring
With 4 colors, could do it.
L25
79
4-Color Theorem
THM: Any planar map of regions can be depicted using 4 colors so that no two regions that share a positive-length border have the same color. Proof by Haaken and Appel used exhaustive computer search.
L25
80
From Map Coloring to Graph Coloring

The problem of coloring a map, can be reduced to a graph-theoretic problem:
L25
81

For each region introduce a vertex:
L25
82

For each pair of regions with a positivelength common border introduce an edge:
L25
83
From Maps to Graphs to Dual Graphs

Really, could think of original map as a graph, and we are looking at dual graph:
L25
84
Dual Graphs : 1) Put vertex inside each region:
L25
85
Dual Graphs : 2) Connect vertices across common edges:
L25
86
Definition of Dual Graph

DEF: The dual graph G ^ of a planar graph G = (V, E, R) [Vertices, Edges, Regions] is the graph obtained by setting

Vertices of G ^: V (G ^ ) = R Edges of G ^: E (G ^ ) = set of edges of the form {F1,F2} where F1 and F2 share a common edge.
L25
87

So take dual graph:
L25
88

Coloring regions is equivalent to coloring vertices of dual graph.
L25
89
Definition of Colorable
DEF: Let n be a positive number. A simple graph is n -colorable if the vertices can be colored using n colors so that no two adjacent vertices have the same color. The chromatic number of a graph is smallest number n for which it is n -colorable. EG: A graph is bipartite iff it is 2-colorable.
L25 90

Map not 2-colorable, so dual graph not 2colorable:
L25
91

Map not 3-colorable, so graph not 3colorable:
L25
92

Graph is 4-colorable, so map is as well:
L25
93
4-Color Theorem Graph Theory Version

THM: Any planar graph is 4-colorable.
L25
94
Graph Coloring and Schedules

EG: Suppose want to schedule some final exams for CS courses with following call numbers: 1007, 3137, 3157, 3203, 3261, 4115, 4118, 4156 Suppose also that there are no common students in the following pairs of courses because of prerequisites: 1007-3137 1007-3157, 3137-3157 1007-3203 1007-3261, 3137-3261, 3203-3261 1007-4115, 3137-4115, 3203-4115, 3261-4115 1007-4118, 3137-4118 1007-4156, 3137-4156, 3157-4156 How many exam slots are necessary to schedule exams?
L25 95

Turn this into a graph coloring problem. Vertices are courses, and edges are courses which cannot be scheduled simultaneously because of possible students in common:
3203 3137 1007 3157
L25
3261 4115 4118 4156

96

One way to do this is to put edges down where students mutually excluded
3203 3137 1007 3157 4156 3261 4115 4118
L25
97

and then compute the complementary graph:
3203 3137 1007 3157 4156 3261 4115 4118
L25
98

and then compute the complementary graph:
3203 3137 1007 3157 4156 3261 4115 4118
L25
99

Redraw:
3137 1007 3203 3261 4115 3157 4156 4118
L25
100

Not 1-colorable because of edge
3137 1007 3203 3261 4115 3157 4156 4118
L25
101

Not 2-colorable because of triangle
3137 1007 3203 3261 4115 3157 4156 4118
L25
102

Is 3-colorable. Try to color by Red, Green, Blue.
3137 1007 3203 3261 4115 3157 4156 4118
L25
103

WLOG. 3203-Red, 3157-Blue, 4118-Green:
3137 1007 3203 3261 4115 3157 4156 4118
L25
104

So 4156 must be Blue:
3137 1007 3203 3261 4115 3157 4156 4118
L25
105

So 3261 and 4115 must be Red.
3137 1007 3203 3261 4115 3157 4156 4118
L25
106

3137 and 1007 easy to color.
3137 1007 3203 3261 4115 3157 4156 4118
L25
107

So need 3 exam slots:
3137 3203 3261
Slot 2
4115
Slot 1
1007 3157 4156
4118
Slot 3
108
L25

Planar Graphs

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Planar Graphs

Загружено:

Авторское право:

Доступные форматы

EULER PATH AND EULER CIRCUIT

Euler and Hamilton Paths -Motivation

Pencil Drawing Problem -Euler Paths

Pencil Drawing Problem -Euler Paths

Pencil Drawing Problem -Euler Paths

Euler Paths and Circuits Definition

Taxicab Problem -Hamilton Paths

Taxicab Problem -Hamilton Paths

Hamilton Paths and Circuits Definition

Finding Euler Paths

Finding Euler Circuits

Finding Euler Circuits

Euler Circuit All Degrees Even

Generalizing to Euler Paths

Generalizing to Euler Paths

Q: But why does it have an Euler path?

Generalizing to Euler Paths

So can add a phantom edge between odd degree vertices:

Generalizing to Euler Paths

All degrees now even so find Euler cycle:

Generalizing to Euler Paths

Now remove phantom edge obtaining:

Generalizing to Euler Paths

Generalizing to Euler Paths

Blackboard Exercises for 7.5

graph algorithms often specialized to planar graphs (e.g. traveling salesperson)

Circuits usually represented by planar graphs

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Planar Graphs -Common Misunderstanding

Proving Planarity 3-Cube

Proving Planarity? 4-Cube

Seemingly not planar, but how would one prove this!

r increases by 1. |E | increases by 1. |V | unchanged. += (1-1+0)

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Animated Invariance of Euler Characteristic

Proving that Q4 is Non-Planar

Proving that Q4 is Non-Planar

Blackboard exercises for 7.7

From Map Coloring to Graph Coloring

From Map Coloring to Graph Coloring

From Map Coloring to Graph Coloring

From Maps to Graphs to Dual Graphs

Dual Graphs : 1) Put vertex inside each region:

From Maps to Graphs to Dual Graphs