PRESENTATION

ON
GRAPH COLORING
 Graph Coloring
Graph coloring is one of the oldest concepts in the theory
of graphs.
Graph coloring is one of the most useful models in graph
theory.
 DEFINITION
Graph coloring is the study of assigning a color to each vertex
such that no vertex has the same color as any other to which it
is connected.
A graph has been colored if a color has been assigned to each
vertex in such a way that adjacent vertices have different color.
If there is an edge between them
EXAMPLE
 Terminologies of
Graphs
Chromatic Number
Optimal Coloring
Coloring Planar Graphs
k-coloring
The chromatic number of a graph G is the smallest number of colors with
which it can be colored. We will use the notation x (G) to denote the
chromatic number of G.
In the example, the chromatic number is 4.
 An optimal coloring of a graph G is a coloring of the vertices of G using
the fewest possible number of colors.
 Coloring Planar Graphs

A graph is planar if it can be drawn in a plane without

edge-crossings.
 K-coloring: A k-coloring of a graph G is a coloring of the vertices of G
using k colors and satisfying the requirement that adjacent vertices are
colored with different colors.
 A k-coloring of graph G is an assignment of integers {1, 2 . . . k} (the
colors) to the vertices of G in such a way that neighbors receive different
integers. The chromatic number of G is the smallest k such that G has a k-
coloring.
 Vertex Coloring
 Edge Coloring
 Face Coloring
 A vertex coloring of a graph is to color the vertices of
the graph in such a way that any two adjacent vertices
receive different colors.
 An edge coloring of a graph is to color the edges of
the graph in such a way that any two adjacent edges
receive different colors.
A face coloring of a planar graph assigns a color to each face or region so
that no two faces that share a boundary have the same color.
 Graph Coloring has many applications in job scheduling,
assignments of classes/classrooms, assignments of wireless
channels.
There are many applications of Graph Coloring such as
 Aircraft scheduling
 Making Schedule or Time Table
 Mobile Radio Frequency Assignment
 Suduku
 Register Allocation
 Bipartite Graphs
 Map Coloring:
 Color a map such that two regions with a common border are assigned different
colors.
 Each map can be represented by a graph
 Each region of the map is represented by a vertex.Edges connect two vertices if
the regions represented by these vertices have a common border.
 The resulting graph is called the dual graph of the map.
 Four colors are sufficient to color any map
 Suduku 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.
 Each integer label is a “color”
 A vertex is adjacent to another vertex if one of the following hold:
 Same row
 Same column
 Same 3x3 grid