Proposal : Implementing M - Coloring Problem
Opened this issue · 0 comments
AbhijitMotekar99 commented
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.
