Planar graphs

Mohammed Brahimi
Utilities problem
Applications of Planar Graphs
• Urban Planning
• Planar graphs model utility line layouts, ensuring non-crossing connections between houses.

• Computer-Aided Design
• They are used in electronic system design, such as integrated circuits, for optimal layout and
minimized total area.

• Network Design
• Network topologies are represented as planar graphs to aim for non-interfering connections.

• Subway Route Planning

• Planar graphs aid in efficient route determination for subway lines, reducing intersections to
prevent congestion and bottlenecks.
Applications of Planar Graphs
• Graph Drawing
• Planar graphs are crucial in graph drawing for software engineering, databases, data visualization, and more.

• Wireless Communication
• In wireless ad hoc networks, planar graphs represent possible communication paths, minimizing interference
and ensuring efficient communication.

• Scheduling
• Certain scheduling problems can be modelled as planar graphs, helping to organize overlapping tasks.

• Maze Solving Algorithms

• Planar graphs are useful for maze generation and solving algorithms, representing corridors and junctions in
the maze.

Any situation involving connected "points" without overlap can

potentially use planar graphs.
What is planar graph ?
• Definition:
A planar graph can be drawn in a plane without edge crossings, with edges
only intersecting at vertices they're incident to.

• Plane Drawing (embedding)

• Any drawing of a planar graph without crossings.
• Plane Graph
• An abbreviation used for a plane drawing of a planar graph.

Not all drawings of a planar graph are plane graphs. Only those without
edge crossings qualify as plane graphs.
Example
Is 𝐾4 graph planar ?
What's the largest complete planar graph !?
Is 𝐾5 a planar graph ?
What's the largest bipartite complete planar graph !?

𝑲𝟏,𝒏 𝑲𝟐,𝑵 𝑲𝟑,𝟑

Is 𝑲𝟑,𝟑 planar graph ?
Is 𝑲𝟑,𝟑 planar graph ?
THEORME 1

The graphs 𝑲𝟓 and the graph 𝑲𝟑,𝟑 are non-planar

Proof
• Later in the lecture.
Questions ???

• Can a graph be planar even if it contains a non-planar subgraph?

• Is a subgraph of a planar graph also planar?

• Can we identify basic non-planar subgraphs within every non-planar graph?

• How can we tell if a graph is planar ?

Subdivision of a graph
• A subdivision of a graph is the
resultant graph obtained by
inserting vertices of degree 2 in
its edges.

• Two graphs are homeomorphic if

they can both be obtained by
subdividing the same graph.
THEOREM 2 (Kuratowski. 1930)

A graph is planar if and only if it contains no subgraph homoeomorphic

to 𝐾5 or 𝐾3,3 .

• Proof (not covered)

• Intuition

The theorem often confirms a graph's non-planarity by identifying a subgraph

homeomorphic to K5 or K3,3.
Example 1
Example 2 (Petersen graph)
Edge contraction
• Edge contraction is the process
of removing an edge and
merging the incident vertices
into a single vertex, while
maintaining the remaining
adjacency relationships.

• A graph H is contractible to a
graph G, if we can obtain H by
successively contracting the
edges of G.
THEOREM 3

A graph is planar if and only if it contains no subgraph contractible to

𝐾5 or 𝐾3,3 .

• Proof (not covered)

• Intuition

The theorem often confirms a graph's non-planarity by identifying a subgraph

contractible to 𝑲𝟓 or 𝑲𝟑,𝟑 .
Example
Cycle Method for Planarity Testing
• The Cycle Method is a heuristic algorithm used to test whether a given graph is planar.
• It is applicable to small graphs with a Hamiltonian cycle, providing a quick and intuitive
planarity test.

• Steps of the Cycle Method

1. Find a Hamiltonian cycle C in the graph G.
2. Draw C as a regular polygon and list the remaining edges.
3. Divide the remaining edges into two sets, A and B:
1. A: Edges that can be drawn inside C without crossing.
2. B: Edges that can be drawn outside C without crossing.
4. If it is possible to allocate all remaining edges to A and B without crossings, G is planar.
1. Use sets A and B to obtain a plane drawing of G.
5. If it is not possible to allocate the remaining edges without crossings, G is non-planar.

• Incompatibility of edges
• Incompatible edges cannot both be drawn inside C or both be drawn outside C without crossings.
• Compatible edges can be drawn inside or outside C without crossings.
Example
Example
• ac bd df
• ad bg eh
• ae bi fh
• ah gi

• A = {ac}
• We put incompatible with A in B
• B = { bd, bg, bi}
Example
• ac bd df
• ad bg eh
• ae bi fh
• ah gi

• B = { bd, bg, bi}

• We add incompatible edges with B in A
• A = {ac, ad, ae, eh, fh, ah}
Example
• ac bd df
• ad bg eh
• ae bi fh
• ah gi

• A = {ac, ad, ae, eh, fh, ah}

• We add incompatible edges with A in B
• B = { bd, bg, bi,df,gi}
Example
• ac bd df
• ad bg eh
• ae bi fh
• ah gi

• A = {ac, ad, ae, eh, fh, ah}

• We add incompatible edges with A in B
• B = { bd, bg, bi,df,gi}
Example
Faces in planar graph
• Any plane drawing of planar graph 𝐺
divides the set of points of the plane into
regions, called faces.

• One face is unbounded and called infinite

face.

• Example:
• Faces of the 𝐾4 : 𝑓1 , 𝑓2 , 𝑓3 , 𝑓4 .
• 𝑓4 is infinite face.
Degree of face
• The degree of 𝑓, denoted by 𝒅𝒆𝒈(𝒇), is the number of edges
encountered in a walk around the boundary of the face 𝑓.

• 𝑑𝑒𝑔 𝑓1 = 3
• 𝑑𝑒𝑔 𝑓2 = 3
• 𝑑𝑒𝑔(𝑓3 ) = 3
• 𝑑𝑒𝑔(𝑓4 ) = 3
Degree of face
• The degree of 𝑓, denoted by 𝒅𝒆𝒈(𝒇), is the number of edges
encountered in a walk around the boundary of the face 𝑓.

• 𝑑𝑒𝑔 𝑓1 = 3
• 𝑑𝑒𝑔 𝑓2 = 5
• 𝑑𝑒𝑔(𝑓3 ) = 3
• 𝑑𝑒𝑔(𝑓4 ) = 5
Handshaking Lemma for Faces
• In any plane drawing of a planar graph, the sum of all the face
degrees is equal to twice the number of edges.

෍ deg 𝑓𝑖 = 2 × |𝐸 𝐺 |

Proof
• In any plane drawing of a planar graph, each edge has two sides:
• The edge may lie on the boundary of a single face.
• The edge can be in the boundaries of two different faces.

• Each edge contributes exactly 2 to the sum of the face degrees.

THEOREM 4 (Euler. 1750)

Let 𝐺 be a plane drawing of a connected planar graph and let 𝑛, 𝑚 and

𝑓 denote respectively the number of vertices, edges and faces of 𝐺.
Then
𝒏−𝒎+𝑭=𝟐

• 𝒏 − 𝒎 + 𝑭 = 𝟐 is called Euler's Formula.

Proof of Euler's Formula
• Proof by induction on the number of edges (𝑚) in graph 𝐺.

• Base Case
• If 𝑚 = 0, then 𝑛 = 1 (as 𝐺 is connected) and 𝐹 = 1 (the infinite face). Hence, the theorem holds true.

• Inductive Step
• Assume the theorem holds for all plane graphs with at most 𝑚 − 1 edges.

• Consider 𝐺, a plane graph with 𝑚 edges.

• If 𝐺 is a tree, then 𝑚 = 𝑛 − 1 and 𝐹 = 1, satisfying 𝑛 − 𝑚 + 𝐹 = 2.
• If 𝐺 is not a tree, choose an edge (𝑒) in some cycle of 𝐺.
• The graph 𝑮 − 𝒆 is connected, with 𝒏 vertices, 𝒎 − 𝟏 edges, and 𝑭 − 𝟏 faces.

• By the induction hypothesis, we can write: 𝒏 − (𝒎 − 𝟏) + (𝑭 − 𝟏) = 𝟐.

• Hence, simplifying, we obtain: 𝒏 − 𝒎 + 𝑭 = 𝟐, which completes the proof.
 Examples

Graph n m F N-m+F
Octahedron
𝑊6
𝐾2,6
4 × 4 square lattice
 Examples

Graph n m F N-m+F
Octahedron 6 12 8 2
𝑊6 6 10 6 2
𝐾2,6 8 12 6 2
4 × 4 square lattice 25 40 17 2
COROLLARY 1
• If 𝐺 is a simple connected planar graph With 𝑛 ≥ 3 vertices and m edges. then
𝑚 ≤ 3𝑛 − 6.

• If, in addition, 𝐺 has no triangles then

𝑚 ≤ 2𝑛 − 4.

Significance
• This corollary can be utilized to identify non-planar graphs, eliminating the need for
the number of faces.
Proof (𝑚 ≤ 3𝑛 − 6)

• If a planar graph has 𝑚 edges and 𝐹 faces.

• σ deg 𝑓𝑖 = 2𝑚 (Handshaking Lemma for Faces)
• deg 𝑓𝑖 ≥ 3 (Each face is bounded at least by 3 edges)
෍ deg 𝑓𝑖 ≥ 3𝐹

• 2𝑚 ≥ 3𝐹
• 𝑛−𝑚+𝐹 =2
• 3𝐹 = 6 − 3𝑛 + 3𝑚
• 6 − 3𝑛 + 3𝑚 ≤ 2𝑚
𝑚 ≤ 3𝑛 − 6
Proof (𝑚 ≤ 2𝑛 − 4)

• If the a planar graph has 𝑚 edges and 𝐹 faces.

• σ deg 𝑓𝑖 = 2𝑚 (Handshaking Lemma for Faces)
• deg 𝑓𝑖 ≥ 4 (no triangle in the graph )
෍ deg 𝑓𝑖 ≥ 4𝐹

• 2𝑚 ≥ 4𝐹
• 𝑛−𝑚+𝐹 =2
• 4𝐹 = 8 − 4𝑛 + 4𝑚
• 8 − 4𝑛 + 4𝑚 ≤ 2𝑚
𝑚 ≤ 2𝑛 − 4
Proof of Theorem 1
The graphs 𝑲𝟓 and the graph 𝑲𝟑,𝟑 are non-planar

• Proof
• 𝑲𝟓
• Number of vertices 𝒏 = 𝟓
• Number of edges 𝒎 = 𝟏𝟎
• 𝟑𝒏 − 𝟔 = 𝟗 < 𝒎 ➔ The graph is non-planar.
• 𝑲𝟑,𝟑 (absence of triangle)
• Number of vertices 𝒏 = 𝟔
• Number of edges 𝒎 = 𝟗
• 𝟐𝒏 − 𝟒 = 𝟖 < 𝒎 ➔ The graph is non-planar.
COROLLARY 2

Let G be a simple connected planar graph. Then G contains a vertex of

degree 5 or less.

• Proof
𝑑𝑖 ≥ 6 ➔ σ 𝑑𝑖 ≥ 6𝑛
➔ 2𝑚 ≥ 6𝑛
➔ 𝑚 ≥ 3𝑛
➔ 𝑚 > 3𝑛 − 6
➔ Contradiction with 𝒎 ≤ 𝟑𝒏 − 𝟔
Dual graph
• Dual graphs capture the
relationships between the faces of
planar graph.

• Associate each vertex with a face of

the original graph.

• Connect the vertices if the

corresponding faces share an edge.

• The geometrical dual graph of planar

graph is planar
Dual Graph Construction
• Given a plane drawing of a planar graph G, its geometric dual graph G* is
constructed using the following two stages:

1. Vertices of dual graph

• Inside each face of 𝐺, we choose a point 𝒗∗ .
• These points will serve as the vertices of 𝐺 ∗ .

2. Edges of dual graph

• We connect two vertices 𝒗∗ related to the faces sharing an edge 𝑒 in 𝐺 by drawing an
edge 𝒆∗ that only crosses 𝑒.
• The edges 𝒆∗ represent the edges of the dual graph G*.
Example
Example
Examples
LEMMA 1
• Let G be a connected planer graph with n vertices, m edges and F
faces, and let its geometric dual 𝐺 ∗ have 𝑛∗ vertices, 𝑚∗ edges and 𝐹 ∗
faces. Then
𝒏∗ = 𝑭, 𝒎∗ = 𝑚 and 𝑭∗ = 𝒏 .
Proof
• 𝒏∗ = 𝑭
• The first relation mentioned in the statement is a consequence of the definition of G*.

• 𝒎∗ = 𝑚
• A consequence of the definition of G*.
• According to the definition, vertices in G* are adjacent if the related faces in G share an edge.
• The number of edges in G* is determined by the number of shared edges between faces in G.

• 𝑭∗ = 𝒏
• By substituting the first two relations into Euler's formula for 𝑮 and 𝑮∗ .
Is the geometrical dual graph unique ?
• Different plane drawings of a planar graph G may give rise to non-
isomorphic dual graphs G*.
Degrees in dual graph

The degree of a face in graph G corresponds to the degree

of the associated vertex in the dual graph G*.
Cuteset and cycle in dual graph

A cycle in graph G is equivalent to a cutset in the dual

graph G*.
Plane graph vs dual graph

Plane drawing G Dual graph G*

Edge of G Edge of G*
Vertex of degree k in G Face of degree k in G*
Face of degree k in G a vertex of degree k in G *
Cycle of length k in G Cutset of G* with k edges
Cutset of G with k edges Cycle of length k in G*
Theorems and corollaries of dual graph

• The theorems and corollaries of planar graphs remain valid in the dual
graph:

• Let G* be a connected planar graph with f faces and m edges, and with no
cutest with 1 or 2 edges.
Then 𝑚 ≤ 3𝑓 − 6

• Let G* be a connected planar graph with no cutset with 1 or 2 edges. Then

G* has a face of degree 5 or less.
Why dual graph is important ?
• An abstract dual of a graph G is a graph G* that:
• Has a one-to-one correspondence with the edges of G
• If a set of edges of G forms a cycle in G if and only if the corresponding set of
edges of G* forms a cutset in G*.
THEORME

A graph is planar if and only if it has an abstract dual.

Intuition
• Finding an abstract dual graph indicates planarity.
• A test on the previous slide checks abstract duality without
constructing the geometric dual.
Conclusion
• Planarity in graphs is a fundamental concept in computer science,
mathematics, and network design.
• Planar graphs can be visually represented without any edges crossing each
other.
• Kuratowski's theorem provides a useful criterion for identifying non-planar
graphs by detecting the presence of specific subgraphs.
• Determining planarity involves examining planar embeddings and applying
Euler's formula: V - E + F = 2.
• Duality plays a significant role in understanding the relationships between
a graph and its dual representation.
• Abstract dual graphs can be used to test for planarity without constructing
the geometrical dual.
References