0
14kviews
Write a short note on Graph coloring

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

Marks: 10M

Year: May 2016

1 Answer
5
544views

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.

Please log in to add an answer.