Lesson 4: Planar graphs and Euler's formula
Counting faces and verifying Euler's formula
SkillsEuler's formulaPlanar graphs and faces
Worked example
The planar graph shown is drawn with no edges crossing.
(a) State the number of vertices, edges and faces.
(b) Show that Euler's formula holds for the graph.
Step 1: Count the vertices
, so .
Step 2: Count the edges in groups
Outer triangle 3, inner triangle 3, and 3 edges joining them, so .
Counting in groups is safer than counting one by one. Check: every vertex has degree 3, and .
Step 3: Count the faces
Inside the inner triangle: 1. Between the triangles: 3 four-sided regions (, and ). Outside the graph: 1. So .
The region outside the graph is a face. It is the one most often missed.
Step 4: Substitute into Euler's formula
✓
Answer
(a) , and . (b) , so Euler's formula holds.
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Count the vertices and edges, and check with the degree total.
Count the faces of a drawing with no crossings, including the outside face.
Substitute into .
Watch out for
Forgetting the outside face gives and .