k-coloring a 3-colorable graph
In this problem, we wish to color any 3-colorable graph while minimizing the number of colors used.
Parameters
- : number of vertices
- : number of edges
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
Displaying 1 of 1 other relevant algorithms