Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

m coloring problem by backtracking #2063

Open
Sidhijain opened this issue May 30, 2021 · 2 comments · May be fixed by #2065
Open

m coloring problem by backtracking #2063

Sidhijain opened this issue May 30, 2021 · 2 comments · May be fixed by #2065

Comments

@Sidhijain
Copy link

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
Copy link

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
Copy link
Author

I have created the pr .Please review and merge it

@Sidhijain Sidhijain linked a pull request May 30, 2021 that will close this issue
Open
8 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

M coloring problem Sidhijain/Algo-Tree
1 participant
@Sidhijain