Planarity and
Euler’s Formula
Planar Graphs and Euler's Formula
definition -In a graph theory, a planar graph is a graph that can be embedded in the plane, it
can be drawn on the plane in such a way that its edges intersect only their endpoints. In other
words, it can be drawn in such a way that no edges cross each other.
When a connected graph can be drawn without any edges crossing, it is
called planar. When a planar graph is drawn in this way, it divides the plane
into regions called faces.
(a) Draw, if possible, two different planar graphs with the same number of
vertices, edges, and faces.
(b) Draw, if possible, two different planar graphs with the same number of vertices
and edges, but a different number of faces
2
The definition of planar includes the phrase “it is possible to.” This means that even if a graph does not look
like it is planar, it still might be. Perhaps you can redraw it in a way in which no edges cross.
Example:
These are k4 planar graph
K4 is a maximal planar graph which can be seen easily. In fact, a planar graph G is a maximal planar
graph if and only if each face is of length three in any planar embedding of G.
3
Non-Planar and Planar Graph
Non-Planar Graph:
A graph is said to be non planar if it cannot be drawn in a plane so that no edge cross.
Ex:
4
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, it can be drawn
“
on the plane in such a way that its edges intersect only at their endpoints. In other words, it can
be drawn in such a way that no edges cross each other.
5
The difference of non-planar between planar graph
Planar and Non-Planar Graphs. Graph A is planar since no link is overlapping with another.
Graph B is non-planar since many links are overlapping. Also, the links of graph B cannot be
“
reconfigured in a manner that would make it planar.
Example Graphs
Planar Non-planar
Butterfly Graph Utility Graph
Complete graph k4 Complete Graph k3, 3
6
Euler’s Formula
▧ Euler’s Formula states that if a finite, connected, planar graph is drawn in the plane without any edge
intersections, and v is the number of vertices, e is the number of edges and f is the number of faces
(regions bounded by edges, including the outer, infinitely large region), then v – e + f = 2
v = number of vertices
f = number of faces
e = number of edges
7
“
As an illustration, in the butterfly graph given above, v = 5, e = 6 and f = 3. In general, if the property holds for all
planar graphs of f faces, any change to the graph that creates an additional face while keeping the graph planar would
keep v − e + f an invariant. Since the property holds for all graphs with f = 2, by mathematical induction it holds for
all cases. Euler's formula can also be proved as follows: if the graph isn't a tree, then remove an edge which
completes a cycle. This lowers both e and f by one, leaving v − e + f constant. Repeat until the remaining graph is a
tree; trees have v = e + 1 and f = 1, yielding v − e + f = 2, the Euler characteristic is 2.
Theorem if n, q and f denote respectively, the number of vertices, edges and faces
in a plane drawing of a planar graph with t components, then
n- q + r= 2.
8
Thanks!
