An exact method for graph coloring

We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method. 2005 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2006
• Where: COR
• Authors: Corinne Lucet, Florence Mendes, Aziz Moukrim
• Keywords: COR 2006, Entry Graph, Exact Algorithms Instances, Exact Method