#sudhakaratchala #daavideos #daaplaylist
Let G=(V,E) be a graph, in graph colouring problem, we have to find whether all the vertices of the given graph are coloured or not, with the constraint that no two adjacent vertices have the same colour.







The problem has two versions
1.m-colourability decision problem
2.m-colourability optimization problem