11 - Planar Graphs - Slides

Introduction Basic definitions Results on Planar graphs
Graph Theory
Planar graphs
A. Senthil Thilak
Graph Theory A. Senthil Thilak

Introduction
• Topological graph theory is broadly conceived in the study of

graph layouts.
Motivation:
• Initial motivation was involved in the famous Four Color
theorem:“Is it possible to have a proper coloring for a
planar graph with four colors?”
• Later, due to the problem of circuit layouts on Silicon
chips. (Wire crossings cause problems in layouts. So, it is
required to identify a design without any crossing, equivalently,
constructing a planar graph with a given number of vertices
and edges.)

Three Utilities problem/Puzzle
Three Utilities problem/Puzzle: The classical mathematical

puzzle known as the three utilities problem; the three cottages
problem or sometimes water, gas and electricity problem can
be stated as follows:
Suppose there are three cottages on a plane (or sphere)
and each needs to be connected to the gas, water, and
electricity companies. Without using a third dimension or
sending any of the connections through another company or
cottage, is there a way to make all nine connections without
any of the lines crossing each other?

A Model of the problem:


Graph Model of
3-Utilities problem

Solving the above problem is

equivalent to obtaining a planar
embedding of the above graph,
namely K3,3 .
Graph Model of
3-Utilities problem

Solving the above problem is

equivalent to obtaining a planar
embedding of the above graph,
namely K3,3 .
The answer is NO!!! since

the corresponding graph model,
Graph Model of namely, K3,3 is non-planar.
3-Utilities problem

Arguments about drawings of graphs in the plane are based on the

fact that every closed curve in the plane separates the plane into
two regions (inside/interior and outside/exterior)

Definition
A graph G is said to be embedded on a surface S if it can be
drawn on S so that no two edges intersect, except at their ends.
Such a graph is said to have an embedding on S.
Definition
A graph G is said to be planar if it has a planar embedding. i.e., if
it can be drawn on a plane without intersecting edges, except at
their ends.
Such a drawing of a planar graph G is called a Planar embedding
of G .


Observe that the above planar embedding divides the plane into
bounded regions and these bounded regions are called faces.


f6
f2
f1
f5
f3
f4
The given planar embedding divides the plane into 6 faces - 5 bounded
faces (called interior faces) and 1 unbounded face (called exterior face).

f6
f2
f1
f5
f3
f4
Note: 1. Every planar embedding of G is a graph isomorphic to G .

f6
f2
f1
f5
f3
f4
2. The notion of a face applies also to embeddings of graphs on other
surfaces.

f6
f2
f1
f5
f3
f4
2. The notion of a face applies also to embeddings of graphs on other
surfaces.
3. Every tree is a planar graph and has exactly one face.

Embeddings on other surfaces

We have seen that not all graphs are emeddable on a plane. (i.e., Not all
graphs are planar, eg. K3,3 is non-planar).


However, every graph can be embedded on the three dimensional space.


(a) Embedding of K5 on a Torus


(b) Embedding of K3,3 on a

(a) Embedding of K5 on a Torus Möbius band

Dual graphs
Degree of a face: The degree of a face is the number of edges
lying on the boundary of the face, with cut edge being counted
twice.
Figure: A plane graph with 6 faces
deg (f2 ) =
Dual graphs
twice.
deg (f2 ) = 4;
Dual graphs
twice.
deg (f2 ) = 4; deg (f3 ) =

Dual graphs
twice.
deg (f2 ) = 4; deg (f3 ) = 3;

Dual graphs
twice.
deg (f2 ) = 4; deg (f3 ) = 3; deg (f5 ) =

Dual graphs
twice.
deg (f2 ) = 4; deg (f3 ) = 3; deg (f5 ) = 6

Dual of a graph: Given a plane graph G , we can define another graph

G ∗ as follows:

Dual of a graph: Given a plane graph G , we can define another graph

G ∗ as follows:
Corresponding to each face f of G , there is a vertex f ∗ in G ∗ and
corresponding to each edge e of G , there is an edge e ∗ in G ∗ such that
two vertices f ∗ and g ∗ in G ∗ are joined by an edge e ∗ if and only if their
corresponding faces are separated by the edge e in G .
(a) A graph G
(b) G ∗ : Dual of G

Relation between a graph and its dual

The following relations are direct consequences of the definition of dual
graph:
• No. of vertices in G ∗ = No. of faces in G .

• No. of edges in G ∗ = No. of edges in G .
• Degree of a vertex in G ∗ = Degree of the corresponding face in G .
Theorem X
If G is a planar graph, then deg (f ) = 2|E (G )|, where F is the set of
f ∈F
all faces in G .

Relation between a graph and its dual

The following relations are direct consequences of the definition of dual
graph:
• No. of vertices in G ∗ = No. of faces in G .

• No. of edges in G ∗ = No. of edges in G .
• Degree of a vertex in G ∗ = Degree of the corresponding face in G .
Theorem X
If G is a planar graph, then deg (f ) = 2|E (G )|, where F is the set of
f ∈F
all faces in G .
Proof.
Apply Hand-shaking lemma to G ∗ , the dual of G .

Results on planar graphs

Theorem
Every planar graph can be embedded in a plane such that all edges
are straight line segments.
Theorem (Euler’s theorem)

If G is a connected (p, q) planar graph with r faces, then
p − q + r = 2.


Theorem

p − q + r = 2.
Proof: By induction on q.


Theorem

p − q + r = 2.
Let q = 0.


Theorem

p − q + r = 2.
Let q = 0. Since G is connected, G must be K1 . Hence, p = r = 1
and the result holds.


Theorem

p − q + r = 2.
Let q = 0. Since G is connected, G must be K1 . Hence, p = r = 1
and the result holds.
Suppose that the result holds for all connected planar graphs
having < q edges.

Results on planar graphs (contd...)

Proof. (contd...)
Case (i): G is acyclic.
Then,


Proof. (contd...)
Then, G must be a tree. Hence,


Proof. (contd...)
Then, G must be a tree. Hence, q = p − 1 and r = 1 and hence,
p − q + r = p − p + 1 + 1 = 2.


Proof. (contd...)
p − q + r = p − p + 1 + 1 = 2.
Case (ii): G has a cycle.


Proof. (contd...)
p − q + r = p − p + 1 + 1 = 2.
Suppose, G contains a cycle, say C .


Proof. (contd...)
p − q + r = p − p + 1 + 1 = 2.
Suppose, G contains a cycle, say C . Let e be an edge lying on C . Then
G 0 = G − e is a connected planar graph.


Proof. (contd...)
p − q + r = p − p + 1 + 1 = 2.
G 0 = G − e is a connected planar graph. Let |V (G 0 )| = p 0 ; |E (G 0 )| = q 0 .


Proof. (contd...)
p − q + r = p − p + 1 + 1 = 2.
G 0 = G − e is a connected planar graph. Let |V (G 0 )| = p 0 ; |E (G 0 )| = q 0 .
Then, p 0 = p; q 0 = q − 1 < q and r 0 = r − 1. Therefore, by our
induction hypothesis,
p 0 − q 0 + r 0 = 2.
⇒ p − q + r = p 0 − (q 0 + 1) + (r 0 + 1)
= p0 − q0 − 1 + r 0 + 1
= p 0 − q 0 + r 0 = 2.
Hence, the result is true for all connected planar graphs, by the principle
of induction.

Theorem
If G is a connected planar (p, q) graph with p ≥ 3 and having r
3r
faces, then (i) q ≥ and (ii) q ≤ 3p − 6.
2


Theorem
3r
2
Proof of (i).
Let G be a connected planar (p, q) graph with r faces and p ≥ 3.


Theorem
3r
2
Proof of (i).
Case (i): G is a tree.


Theorem
3r
2
Proof of (i).
Then, q =


Theorem
3r
2
Proof of (i).
Then, q = p − 1 and r =


Theorem
3r
2
Proof of (i).
Then, q = p − 1 and r = 1.


Theorem
3r
2
Proof of (i).
Then, q = p − 1 and r = 1.
p ≥3⇒p−1≥2
⇒ q ≥ 2 > 3/2 = 3r /2
⇒ q ≥ 3r /2.


Proof of (i). (contd...)


Case (ii): G is not a tree.


Then,


Then, G must have a cycle.


Then, G must have a cycle. Since p ≥ 3, any cycle should have
atlest 3 edges and hence,


atlest 3 edges and hence, every face must be bounded by atleast 3
edges.
Therefore,


edges.
Therefore, deg (f ) ≥ 3, ∀ face f in G .


edges.
Also, if F denotes the set of all faces of G , then,


edges.
Also, if F denotes the set of all faces of G , then,
X
2q = deg (f )
f ∈F
≥ 3r
⇒ q ≥ 3r /2.


Proof of (ii).
By Euler’s theorem,


Proof of (ii).
By Euler’s theorem, p − q + r = 2 ⇒ r = 2 − p + q.
Therefore, 3r 3
q≥ ⇒ q ≥ [2 − P + q]
2 2
⇒ 2q ≥ 6 − 3p + 3q
⇒ q ≤ 3p − 6.


Proof of (ii).
Therefore, 3r 3
q≥ ⇒ q ≥ [2 − P + q]
2 2
⇒ 2q ≥ 6 − 3p + 3q
⇒ q ≤ 3p − 6.
Corollary
If G is a connected planar (p, q) graph without triangles, then q ≤ 2p − 4.


Proof of (ii).
Therefore, 3r 3
q≥ ⇒ q ≥ [2 − P + q]
2 2
⇒ 2q ≥ 6 − 3p + 3q
⇒ q ≤ 3p − 6.
Corollary
If G is a connected planar (p, q) graph without triangles, then q ≤ 2p − 4.
Proof. Hint.
Proceed as in above proof, except that as G has no triangle, each face
must be bounded by atleast 4 edges and hence deg (f ) ≥ 4, for all face f
in G .

Exercise:
1 Show that the graphs K5 and K3,3 are non-planar.


Exercise:
2 (Generalization of Euler’s theorem) If G is a (p, q) planar
graph with r faces and k components, then show that p - q +
r = k + 1.


Exercise:
r = k + 1.
Theorem
If a graph G is planar, then every subgraph of G is also planar.


Exercise:
r = k + 1.
Theorem
If a graph G is planar, then every subgraph of G is also planar.
Theorem
If a graph G is non-planar, then every subdivision of G is
non-planar.
[A subdivision of a graph is a graph obtained by a sequence of

subdivision of edges.]

Note:


Note:
• Any graph containing a non-planar graph as its subgraph is
non-planar.


Note:
non-planar.
• Any graph containing K5 or K3,3 or their subdivisions is
non-planar.


Note:
non-planar.
non-planar.
Theorem (Kuratowski’s theorem)

A graph G is planar if and only if it contains no subdivision of K5
or K3,3 .


Note:
non-planar.
non-planar.

or K3,3 .
Application of Kuratowski’s theorem:



Note:
non-planar.
non-planar.

or K3,3 .
Application of Kuratowski’s theorem:

2 Show that the Petersen graph is non-planar.

Results on Maximal planar graphs
Definition (Maximal planar graphs:)

A graph G is said to be maximal planar, if no edge can be added
to it without loosing its planarity.

Results on Maximal planar graphs
Definition (Maximal planar graphs:)

A graph G is said to be maximal planar, if no edge can be added
to it without loosing its planarity.
Results on Maximal planar graphs:

1 In a maximal planar graph, each face is a triangle and it is
called a triangulated graph.
2 If G is a maximal planar (p, q) graph, then q = 3p − 6.

11 - Planar Graphs - Slides

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

11 - Planar Graphs - Slides

Uploaded by

Copyright:

Available Formats

Introduction Basic definitions Results on Planar graphs

Graph Theory A. Senthil Thilak

• Topological graph theory is broadly conceived in the study of

Graph Theory A. Senthil Thilak

Three Utilities problem/Puzzle

Three Utilities problem/Puzzle: The classical mathematical

Graph Theory A. Senthil Thilak

A Model of the problem:

Graph Theory A. Senthil Thilak

A Model of the problem:

Graph Theory A. Senthil Thilak

A Model of the problem:

Graph Theory A. Senthil Thilak

A Model of the problem:

Solving the above problem is

Graph Theory A. Senthil Thilak

A Model of the problem:

Solving the above problem is

The answer is NO!!! since

Graph Theory A. Senthil Thilak

Arguments about drawings of graphs in the plane are based on the

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Graph Theory A. Senthil Thilak

Embeddings on other surfaces

Graph Theory A. Senthil Thilak

Embeddings on other surfaces

Graph Theory A. Senthil Thilak

Embeddings on other surfaces

(a) Embedding of K5 on a Torus

Graph Theory A. Senthil Thilak

Embeddings on other surfaces

(b) Embedding of K3,3 on a

Graph Theory A. Senthil Thilak

Figure: A plane graph with 6 faces

Figure: A plane graph with 6 faces

Figure: A plane graph with 6 faces

deg (f2 ) = 4; deg (f3 ) =

Figure: A plane graph with 6 faces

deg (f2 ) = 4; deg (f3 ) = 3;

Figure: A plane graph with 6 faces

deg (f2 ) = 4; deg (f3 ) = 3; deg (f5 ) =

Figure: A plane graph with 6 faces

deg (f2 ) = 4; deg (f3 ) = 3; deg (f5 ) = 6

Dual of a graph: Given a plane graph G , we can define another graph

Graph Theory A. Senthil Thilak

Dual of a graph: Given a plane graph G , we can define another graph

Graph Theory A. Senthil Thilak

Relation between a graph and its dual

• No. of vertices in G ∗ = No. of faces in G .

Graph Theory A. Senthil Thilak

Relation between a graph and its dual

• No. of vertices in G ∗ = No. of faces in G .

Graph Theory A. Senthil Thilak

Results on planar graphs

Theorem (Euler’s theorem)