Fet: add "M-Coloring" Problem in Backtracking #1343
Description
Motivation
M-Coloring: 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
Examples
No response
Possible workarounds
No response
Additional information
No response