m coloring problem by backtracking
Sidhijain opened this issue · 2 comments
Sidhijain commented
m coloring
In this there is a undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with the same color.
Please assign this issue to me
github-actions commented
Hi 😄, @Sidhijain Thanks for creating issue at AlgoTree, do read and follow the Code of Conduct and the Contribution Guidelines while contributing. Refer to PR's which has been merged earlier in AlgoTree Click Here Like, How many File they have changed?, Which type of files need to be change? and many more.
Sidhijain commented
I have created the pr .Please review and merge it