An exact approach for the Vertex Coloring Problem


Given an undirected graph G = (V , E), the Vertex Coloring Problem (VCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number of colors used is minimized. In this paper, we present an exact algorithm for the solution of VCP based on the well-known Set Covering formulation of the problem. We… (More)
DOI: 10.1016/j.disopt.2010.07.005


7 Figures and Tables

Cite this paper

@article{Malaguti2011AnEA, title={An exact approach for the Vertex Coloring Problem}, author={Enrico Malaguti and Michele Monaci and Paolo Toth}, journal={Discrete Optimization}, year={2011}, volume={8}, pages={174-190} }