00990nas a2200181 4500008004100000245006900041210006600110300001300176520046400189653002800653653002000681100001300701700001300714700001400727700001200741700001600753856003900769 2003 eng d00aA new permutation model for solving the graph k-coloring problem0 anew permutation model for solving the graph kcoloring problem a189--1993 aThis paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation and an improved version of the traditional graph coloring technique DSATUR on an extensive list of graph k-coloring problem instances with different properties. The results show that our model outperforms the improved DSATUR on most of the problem instances.10aconstraint satisfaction10agraph colouring1 aJuhos, I1 aTÃ³th, A1 aTezuka, M1 aTann, P1 aHemert, J I uhttp://research.nesc.ac.uk/node/24