Graph coloring, an NP-complete problem is used in many real-world applications. The minimum color, that is, the chromatic number of a connected graph is determined using different soft computing strategies. This article gives some of the solutions obtained for queen graphs using evolutionary methods.