C. V.

RAMAN
GLOBAL UNIVERSITY

DEPARTMENT OF CSE
Experiential Learning Project

Design and Analysis of

Algorithm
 Topic-
GRAPH
COLORING

DEPARTMENT OF CSE
 PRESENTED
BY:
2101020231 Ankit Babu
2101020232 DeepRaj Anand
(leader)
2101020820 Gaurav Pradhan
2101020236 Naveen Shah
2101020801 Sayandeep Pal

Under the
Guidance of:
DR. Madhusmita Sahu
ASSISTANT PROFESSOR
DEPARTMENT OF
COMPUTERSCIENCE &
ENGINEERING

DEPARTMENT OF CSE
 INTRODUCTION
Graph coloring can be described as a process of assigning colors to the vertices of a graph. In
this, the same color should not be used to fill the two adjacent vertices. We can also call graph
coloring as Vertex Coloring. In graph coloring, we have to take care that a graph must not
contain any edge whose end vertices are colored by the same color. This type of graph is known
as the Properly colored graph.
Vertex coloring is often used to introduce graph coloring problems, since other coloring
problems can be transformed into a vertex coloring instance. For example, an edge coloring of a
graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a
vertex coloring of its dual. However, non-vertex coloring problems are often stated and studied
as-is. This is partly pedagogical, and partly because some problems are best studied in their non-
vertex form, as in the case of edge coloring

DEPARTMENT OF CSE
 HISTORY
The first results about graph coloring deal almost exclusively with planar graphs in the form of the coloring of
maps. While trying to color a map of the counties of England, Francis Guthrie postulated the four-color
conjecture, noting that four colors were sufficient to color the map so that no regions sharing a common border
received the same color.

DEPARTMENT OF CSE
VERTEX COLOURING
A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge
connects two identically colored vertices. The most common type of vertex coloring seeks to
minimize the number of colors for a given graph. Such a coloring is known as a minimum
vertex coloring, and the minimum number of colors which with the vertices of a graph G may be
colored is called the chromatic number, denoted X(G).
 
A vertex coloring of a graph with k or fewer colors is known as a k-coloring. A graph having a
k-coloring (and therefore chromatic number X(G)<=k) is said to be a k-colorable graph, while a
graph having chromatic number X(G)=k is called a k-chromatic graph. The only one-colorable
(and therefore one-chromatic) graphs are empty graphs, and two-colorable graphs are exactly
the bipartite graphs. The four-color theorem establishes that all planar graphs are 4-colorable
 CH ROM ATI C NU MB ER

The chromatic number can be described as the minimum number of colors

required to properly color any graph. In other words, the chromatic number
can be described as a minimum number of colors that are needed to color any
graph in such a way that no two adjacent vertices of a graph will be assigned
the same color.

DEPARTMENT OF CSE
 Types of Graph And their chromatic
number-
1. Cycle graph-
A graph will be known as a cycle graph if it contains
'n' edges and 'n' vertices (n >= 3), which form a cycle
of length 'n'. There can be only 2 or 3 number of
degrees of all the vertices in the cycle graph.
1. The chromatic number in a cycle graph will be 2
if the number of vertices in that graph is even.
2. The chromatic number in a cycle graph will be 3
if the number of vertices in that graph is odd

DEPARTMENT OF CSE
2.Planner Graph
A graph will be known as a planner graph if it is drawn in a plane. The edges of the planner
graph must not cross each other.
In the above graph, there are 2 different colors for four vertices, and none of the edges of this
graph cross each other. So
Chromatic number = 2
Here, the chromatic number is less than 4, so this graph is a plane graph
3. Complete Graph
A graph will be known as a complete graph if only one edge is used to join every two distinct
vertices. Chromatic Number n a complete graph, the chromatic number will be equal to the
number of vertices in that graph.
There are 4 different colors for 4 different vertices, and none of the colors are the same in the
above graph. According to the definition, a chromatic number is the number of vertices. So,
Chromatic number = 4
 
4.Bipartite Graph

A graph will be known as a bipartite graph if it contains two sets of

vertices, A and B. The vertex of A can only join with the vertices of
B. That means the edges cannot join the vertices with a set.
In any bipartite graph, the chromatic number is always equal to 2.
There are 2 different sets of vertices in the above graph. So the
chromatic number of all bipartite graphs will always be 2.
5.Tree:
A connected graph will be known as a tree if there are no circuits in
that graph. In a tree, the chromatic number will equal to 2 no matter
how many vertices are in the tree. Every bipartite graph is also a tree.
There are 2 different colors for five vertices.
A tree with any number of vertices must contain the chromatic
number as 2.
Edge coloring

Edge coloring is a concept in graph theory that involves assigning colors to the edges of a
graph in such a way that no two adjacent edges have the same color. The goal of edge
coloring is to find the minimum number of colors required to color the edges of a graph.

List edge coloring involves assigning a list of colors to each edge, and the goal is to find a
coloring where each edge is assigned a color from its list.
Edge coloring problems have applications in a variety of fields, including scheduling,
telecommunications, and computer networking.
 APPLICATIONS OF GRAPH COLOURING
1) Making Schedule or Time Table: Suppose we want to make am exam schedule for a
university. We have list different subjects and students enrolled in every subject.
Many subjects would have common students (of same batch, some backlog
students, etc). So this is a graph coloring problem where minimum number of time
slots is equal to the chromatic number of the graph.

2) ) Mobile Radio Frequency Assignment: When frequencies are assigned to towers,

frequencies assigned to all towers at the same location must be different. How to
assign frequencies with this constraint? What is the minimum number of frequencies
needed? This problem is also an instance of graph coloring problem where every
tower represents a vertex and an edge between two towers represents that they are in
range of each other.

DEPARTMENT OF CSE
 3) Sudoku: Sudoku is also a variation of Graph coloring problem where every cell
represents a vertex. There is an edge between two vertices if they are in same row or
same column or same block

4) Map Coloring: Geographical maps of countries or states where no two adjacent cities
cannot be assigned same color. Four colors are sufficient to color any map

DEPARTMENT OF CSE
 References-
 Computer Algorithms by Ellis Horowitz Sartaj Sahni Sanguthevar Rajasekaran.

 https://javatpoint.com/Graph_coloring

 odecrucks.com

DEPARTMENT OF CSE
 Thank You!

DEPARTMENT OF CSE