#k-Graph Coloring
In this case, the number of colors we have is given as an input, and we want to determine the number of all possible k-colorings of a graph. In other words, calculate the value of the chromatic polynomial of the graph with input k.
Parameters
- : number of vertices
- : number of edges
- : number of colors given to color the graph
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table