| Article ID: | iaor20031578 |
| Country: | Netherlands |
| Volume: | 116 |
| Issue: | 1 |
| Start Page Number: | 79 |
| End Page Number: | 90 |
| Publication Date: | Oct 2002 |
| Journal: | Annals of Operations Research |
| Authors: | Coll Pablo, Marenco Javier, Daz Isabel Mndez, Zabala Paula |
In this paper we present a study of the polytope associated to a classic linear integer programming formulation of the graph coloring probelm. We determine some families of facets. This is the initial step for the development of a branch-and-cut algorithm to solve large instances of the graph coloring problem.