Algo-Tree icon indicating copy to clipboard operation
Algo-Tree copied to clipboard

Published 20 hours ago • verified publisher icon Algo-Phantoms

m coloring problem by backtracking

Open Sidhijain opened this issue 3 years ago • 2 comments

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

Sidhijain avatar May 30 '21 12:05 Sidhijain

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.

github-actions[bot] avatar May 30 '21 12:05 github-actions[bot]

I have created the pr .Please review and merge it

Sidhijain avatar May 30 '21 12:05 Sidhijain