Planar Graphs

and Euler’s
Formula
8C
Learning To be able to identify planar
graphs either visually or using
Intention Euler’s formula.

2
Planar Graphs
Planar Graphs are graphs that can be drawn on a plane so that no edges
intersect, except at vertices.
Example:
Although not immediately evident
the two graphs to the right are
isomorphic. With the second one
being drawn so that it is evident it
is planar

Graph Theory 3
Your turn:
Redraw the graph shown below in planar form:

2 3

4 5

Graph Theory 4
Faces of a graph
Graphs can be thought to be dividing the paper it is drawn on into regions
known as “faces”.

All graphs will have a region outside the

edges known as an infinite face. 𝑓 3
1 4
𝑓
For example: 𝑓 1
2

The graph shown to the right has three 2 3

faces (, , and ).

Graph Theory 5
Euler’s formula
Leonard Euler (mentioned previously), discovered a relationship between the
faces, edges, and vertices in planar graphs.

For a connected planar graph:

number of vertices – number of edges + number of faces = 2
Or:

Graph Theory 6
Your turn:

For the graph shown below verify Euler’s formula.

𝑓 3
1 4
𝑓 2
𝑓 1
2 3

Therefore the formula is true for the

graph shown.

Graph Theory 7
Your turn:

A connected planar graph has 5 vertices and 3 faces. Find the number of edges.

Therefore the graph must have five edges.

Graph Theory 8
Question List

8C - Qns 1, 2ace, 3ace, 4bdf, 5a, 6 – 12

9/3/20XX Presentation Title 9