text: This function solves the m Coloring problem using recursion . It returns false if the m colours cannot be assigned , otherwise , return true and prints assignments of colours to all vertices . Please note that there may be more than one solutions , this function prints one of the feasible solutions .
code: bool graphColoring ( bool graph [ V ] [ V ] , int m , int i , int color [ V ] ) {