Write a short note on Graph coloring

14kviews

written 8.8 years ago by

teamques10 ★ 70k

• modified 8.8 years ago

Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm

Marks: 10M

Year: May 2016

analysis of algorithms

ADD COMMENT EDIT

1 Answer

544views

written 8.8 years ago by

teamques10 ★ 70k

Graph coloring is a problem of coloring each vertex in graph in such a way that no two adjacent vertices have same color and yet m-colors are used. This problem is also called m-coloring problem. If the degree of given graph is d then we can color it with d …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.