Scribd
Upload
3 views

Planar Graphs and Graph Coloring an Overview

This document provides an overview of planar graphs and graph coloring, including definitions, Euler's Formula, and Kuratowski’s Theorem for identifying non-planar graphs. It discusses graph coloring concepts, including chromatic numbers and the Four and Five Colour Theorems, along with examples and a greedy coloring algorithm. Additionally, it presents solved problems to apply the concepts of planarity and coloring in practical scenarios.

Uploaded by

habibullaecm69
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
3 views

Planar Graphs and Graph Coloring an Overview

This document provides an overview of planar graphs and graph coloring, including definitions, Euler's Formula, and Kuratowski’s Theorem for identifying non-planar graphs. It discusses graph coloring concepts, including chromatic numbers and the Four and Five Colour Theorems, along with examples and a greedy coloring algorithm. Additionally, it presents solved problems to apply the concepts of planarity and coloring in practical scenarios.

Uploaded by

habibullaecm69
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/ 8

Planar Graphs and

Graph Coloring: An
Overview
This presentation delves into the fascinating world of planar graphs
and graph coloring. We begin by defining planar graphs and
exploring Euler's Formula and its corollaries. We examine
Kuratowski’s Theorem, providing tools for identifying non-planar
graphs. Moving on to graph coloring, we introduce the concept of
chromatic numbers and explore the Four and Five Colour
Theorems, before illustrating the process with solved problems,
offering a solid foundation for students and researchers in graph
theory.
by Ali
Planar Graphs: Definitions and Examples
Definition Examples

A planar graph is one that can be drawn on a plane The complete graph K4 is planar, easily drawn without
without edges crossing, save at endpoints. This crossings. However, K5, the complete graph with five
drawing is its planar embedding. Visualizing this vertices, isn't planar; no matter how you draw it,
provides an immediate grasp of graph planarity, crossings occur. Similarly, the complete bipartite graph
essential for advanced graph theory applications. K3,3 is also non-planar, illustrating a key constraint in
graph theory.

Planarity constraints directly impact network design and algorithm efficiency.


Euler’s Formula: A Cornerstone of Planarity
Formula Edge Bounds
For any connected planar graph, Euler’s formula is For simple planar graphs (without multiple edges
expressed as V - E + F = 2, where V is the or loops), if V ≥ 3, then E ≤ 3V - 6. Additionally,
number of vertices, E is the number of edges, and for planar graphs lacking triangles, E ≤ 2V - 4.
F is the number of faces, including the unbounded These corollaries help determine graph planarity
outer face. This formula is fundamental in based on edge and vertex counts.
characterizing planar graphs.
Kuratowski’s Theorem:
Identifying Non-Planar
Graphs
Theorem
A graph is non-planar if and only if it contains a subgraph
homeomorphic to K5 (complete graph with five vertices) or K3,3
(complete bipartite graph with six vertices, partitioned into two sets
of three vertices). These are the minimal non-planar graphs.

Homeomorphism
Homeomorphism in graphs means that one graph can be obtained
from the other by a sequence of edge subdivisions. This powerful
theorem provides a definitive test for planarity by checking for these
specific subgraphs.
Graph Coloring: Assigning Colors to Vertices

Definition Chromatic Number


Graph coloring involves assigning The chromatic number, denoted
a color to each vertex of a graph as χ(G), is the minimum number
such that no two adjacent of colors needed to properly color
vertices share the same color.
1 2 a graph. For example, a tree has
This is a fundamental problem a chromatic number of 2, while a
with many applications in complete graph Kn has a
scheduling and resource chromatic number of n.
allocation.
The Four and Five
Colour Theorems
1 Four Colour Theorem
The Four Colour Theorem states that any planar graph
can be colored using at most four colors. This theorem
has significant implications for cartography and
network design.

2 Five Colour Theorem


A simpler variant, the Five Colour Theorem, proves
that any planar graph can be colored using at most
five colors. While not as precise, it is easier to prove
and provides a useful upper bound.
Greedy Colouring Algorithm
Steps
1. Choose an ordering of the vertices.
2. For each vertex, assign the lowest-numbered color
not used by its neighbors.

Example
Consider a graph where vertex a is connected to b, b
is connected to c, c is connected to d, and d is
connected to b. With the order a, b, c, d, the coloring
results in: a: 1, b: 2, c: 3, d: 1, using three colors.
Solved Problems: Applying Planarity and
Coloring Concepts
Problem 1: Planarity Test Problem 2: Chromatic Number
Problem 3: Max Edges in
Planar Graph
Determine if K6 is planar. Given V Find the chromatic number of C5,
= 6 and E = 15, check E ≤ 3V - 6. an odd cycle. Odd cycles require Calculate the maximum number of
The result, 15 ≤ 12, is false, three colors, thus χ(C5) = 3. edges in a planar graph with 12
indicating K6 is not planar. This Understanding cycle coloring is vertices. Using E ≤ 3V - 6, where
applies Euler's formula to assess crucial in network optimization. V = 12, yields E ≤ 30. Planar
graph planarity. graphs are limited in edge density,
which impacts algorithmic design.

You might also like