k-Graph Coloring (Graph Coloring)
Graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In this case, the number of colors we have is given as an input.
$n$: number of vertices
$m$: number of edges
$k$: number of colors given to color the graph
Table of Algorithms
Currently no algorithms in our database for the given problem.