Scribd
Upload
10 views8 pages

Planar Graphs and Graph Coloring An Overview

This document provides an overview of planar graphs and graph coloring, including definitions, Euler's Formula, Kuratowski's Theorem, and the Four and Five Colour Theorems. It discusses the significance of planarity in graph theory and its applications in network design, along with practical examples and solved problems. The presentation aims to establish a foundational understanding for students and researchers in graph theory.

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 PDF, TXT or read online on Scribd
10 views8 pages

Planar Graphs and Graph Coloring An Overview

This document provides an overview of planar graphs and graph coloring, including definitions, Euler's Formula, Kuratowski's Theorem, and the Four and Five Colour Theorems. It discusses the significance of planarity in graph theory and its applications in network design, along with practical examples and solved problems. The presentation aims to establish a foundational understanding for students and researchers in graph theory.

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

Planarity constraints directly impact network design and algorithm efficiency.


Euler9s Formula: A Cornerstone of Planarity
Formula Edge Bounds
For any connected planar graph, Euler9s formula is For simple planar graphs (without multiple edges or
expressed as V - E + F = 2, where V is the number of loops), if V g 3, then E f 3V - 6. Additionally, for planar
vertices, E is the number of edges, and F is the number graphs lacking triangles, E f 2V - 4. These corollaries
of faces, including the unbounded outer face. This help determine graph planarity based on edge and
formula is fundamental in characterizing planar vertex counts.
graphs.
Kuratowski9s 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 a The chromatic number, denoted as
color to each vertex of a graph such Ç(G), is the minimum number of
that no two adjacent vertices share colors needed to properly color a
1 2
the same color. This is a graph. For example, a tree has a
fundamental problem with many chromatic number of 2, while a
applications in scheduling and complete graph Kn has a chromatic
resource allocation. number of n.
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.
1
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
2 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 = 6 Find the chromatic number of C5, an
and E = 15, check E f 3V - 6. The result, odd cycle. Odd cycles require three Calculate the maximum number of
15 f 12, is false, indicating K6 is not colors, thus Ç(C5) = 3. Understanding edges in a planar graph with 12
planar. This applies Euler's formula to cycle coloring is crucial in network vertices. Using E f 3V - 6, where V = 12,
assess graph planarity. optimization. yields E f 30. Planar graphs are limited
in edge density, which impacts
algorithmic design.

You might also like