This repository was archived by the owner on Oct 4, 2024. It is now read-only.
Proposal : Implementing M - Coloring Problem #238
Comments
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Problem Statement: Given an 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.
The text was updated successfully, but these errors were encountered: