Based on parting vertexes into several sets randomly

this paper proposes a genetic algorithm to find independent sets with least members for the classical graph coloring problem.That number of members is the chromatic number of graph.This algorithm induces the idea of modularity function

and uses one way cross-over operator.Through local optimized initial population and filial generation

this algorithm can converge quickly.The simulation results on five standard benchmark problems show that the proposed alg...