Scribd
Upload
46 views

Graph Coloring Problem

Uploaded by

martmovie24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
46 views

Graph Coloring Problem

Uploaded by

martmovie24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Graph Coloring Problem

Presented By
Nikhlesh Pathik
Associate Professor CSE
GRAPH COLORING
Let G be a graph and m be a given positive integer. We
want to discover whether the nodes of G can be colored in
such a way that no two adjacent nodes have the same color
yet only m colors are used.
This is termed the m-colorability decision problem.Note
that if d is the degree of the given graph, then it can be
colored with d + 1 colors.
The m-colorability optimization problem asks for the
smallest integer m for which the graph G can be colored .
This integer is referred to as the chromatic number of the
graph.
GRAPH COLORING
For example , the graph of Figure can be colored
with three colors1,2,and 3.
The color of each node is indicated next to it. It
can also be seen that three colors are needed to
color this graph and hence this graph's chromatic
number is 3.
m Coloring Problem
Given an undirected graph and a number m, determine if the
graph can be coloured with at most m colours such that no
two adjacent vertices of the graph are colored with the same
color. Here coloring of a graph means the assignment of
colors to all vertices.
State Space Tree without bounding function
Total node generated without bounding function
Now applying bounding function

You might also like