Scribd
Upload
402 views27 pages

Planar Graphs

A graph is planar if it can be drawn in a plane without any edge crossings. Such a drawing is called a planar representation. K4 and Q3 are planar as they can be drawn without edge crossings, but K3,3 is not planar. A planar representation splits the plane into regions. Euler's theorem states that for a planar graph with e edges and v vertices, the number of regions r equals e - v + 2. Corollary 1 shows that for a planar graph with v vertices and e edges, e is less than or equal to 3v - 6. Corollary 1 and 3 can be used to prove that K5 and K3,3 are nonplanar.

Uploaded by

Hrithik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
402 views27 pages

Planar Graphs

A graph is planar if it can be drawn in a plane without any edge crossings. Such a drawing is called a planar representation. K4 and Q3 are planar as they can be drawn without edge crossings, but K3,3 is not planar. A planar representation splits the plane into regions. Euler's theorem states that for a planar graph with e edges and v vertices, the number of regions r equals e - v + 2. Corollary 1 shows that for a planar graph with v vertices and e edges, e is less than or equal to 3v - 6. Corollary 1 and 3 can be used to prove that K5 and K3,3 are nonplanar.

Uploaded by

Hrithik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 27

Planar graphs

• 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.


Solves problems like….
Is K4 (shown in Figure with two
edges crossing) planar?
Answer… YK4 is planar because it can be
drawn without crossings, as shown in Figure
Verify if the grIs Q3, shown in Figure,
planar?
Q3 is planar, because it can be drawn without any
edges crossing, as shown in
Figure
Is K3,3, shown in Figure 6, planar?
• Any attempt to draw K3,3 in the plane with no edges crossing is
doomed. Let us see why. In any planar representation of K3,3, the
vertices v1 and v2 must be connected to both v4 and v5. These four
edges form a closed curve that splits the plane into two regions, R1
and R2, as shown in Figure (a) in next slide. The vertex v3 is in either
R1 or R2. When v3 is in R2, the inside of the closed curve, the edges
between v3 and v4 and between v3 and v5 separate R2 into two
subregions, R21 and R22, as shown in Figure (b) in next slide.
Answer. The bipartite graph is not
planar
Regions
• A planar representation of a graph splits the plane into regions,
including an unbounded region.
• For instance, the planar representation of the graph shown in Figure
splits the plane into six regions.
Euler’s theorem
• 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.
Question…
• 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?
Answer
• This graph has 20 vertices, each of degree 3, so v = 20. Because the
sum of the degrees of the vertices, 3v = 3 ・ 20 = 60, is equal to
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
• If G is a connected planar simple graph with e edges and v vertices,
where v ≥ 3, then
• e ≤ 3v − 6.
COROLLARY 2
• If G is a connected planar simple graph, then G has a vertex of degree
not exceeding five.
Question: Show that K5 is nonplanar
using Corollary 1.
• The graph K5 has five vertices and 10 edges. However, the inequality e
≤ 3v − 6 is not satisfied for this graph because e = 10 and 3v − 6 = 9.
Therefore, K5 is not planar.
COROLLARY 3
• If a connected planar simple graph has e edges and v vertices with v ≥
3 and no circuits of length three, then e ≤ 2v − 4.
Question: Use Corollary 3 to show
that K3,3 is nonplanar.
• Solution: Because K3,3 has no circuits of length three (this is easy to
see because it is bipartite), Corollary 3 can be used. K3,3 has six
vertices and nine edges. Because e = 9 and 2v − 4 = 8, Corollary 3
shows that K3,3 is nonplanar.
Exercise question: case study
• Can five houses be connected to two utilities without connections
crossing?
Hint: represent the problem as a
complete bipartite graph
• The question is whether K5,2 is planar. It clearly is so, since we can
draw it in the xy-plane by placing the five vertices in one part along
the x-axis and the other two vertices on the positive and negative y-
axis.
Question
Question
Question
Answer of question 5
5. This is K 3 ,3 , with parts {a, d, !} and {b, c, e}. Therefore it is not
planar.
Answer of question 7
7. This graph can be untangled if we play with it long enough. The
following picture gives a planar representation of it.
Answer of question 9
9. If one has access to software such as The Geometer's Sketchpad,
then this problem can be solved by drawing the graph and moving the
points around, trying to find a planar drawing. If we are unable to find
one, then we look for a reason why-either a subgraph homeomorphic
to K5 or one homeomorphic to K3,3 (always try the latter first). In this
case we find that there is a homeomorphic copy of K3,3, with vertices
b, g, and i in one set and a, f, and h in the other; all the edges are there
except for the edge bh, and it is represented by the path beh.
Question 9 diagram

You might also like