Qinghua Wu and Jin-Kao Hao. An Effective Heuristic Algorithm for Sum Coloring of Graphs. Computers & Operations Research 39(7): 1593-1600, 2012. Elsevier
Best sum coloring results reported in Tables 1 and 2 of the above paper on 52 DIMACS and COLOR02 benchmark graphs obtained by the EXSCOL algorithm.
| No. | Instances | Sum | K | Coloring Results |
| 01 | DSJC125.1 | 326 | 7 | DSJC125.1 |
| 02 | DSJC125.5 | 1017 | 20 | DSJC125.5 |
| 03 | DSJC125.9 | 2512 | 44 | DSJC125.9 |
| 04 | DSJC250.1 | 985 | 10 | DSJC250.1 |
| 05 | DSJC250.5 | 3246 | 31 | DSJC250.5 |
| 06 | DSJC250.9 | 8286 | 75 | DSJC250.9 |
| 07 | DSJC500.1 | 2850 | 14 | DSJC500.1 |
| 08 | DSJC500.5 | 10910 | 51 | DSJC500.5 |
| 09 | DSJC500.9 | 29912 | 132 | DSJC500.9 |
| 10 | DSJC1000.1 | 9003 | 22 | DSJC1000.1 |
| 11 | DSJC1000.5 | 37598 | 87 | DSJC1000.5 |
| 12 | DSJC1000.9 | 103464 | 231 | DSJC1000.9 |
| 13 | flat300_20_0 | 3150 | 20 | flat300_20_0 |
| 14 | flat300_26_0 | 3966 | 26 | flat300_26_0 |
| 15 | flat300_28_0 | 4282 | 34 | flat300_28_0 |
| 16 | flat1000_50_0 | 25500 | 50 | flat1000_50_0 |
| 17 | flat1000_60_0 | 30100 | 60 | flat1000_60_0 |
| 18 | flat1000_76_0 | 37167 | 86 | flat1000_76_0 |
| 19 | le450_15a | 2632 | 18 | le450_15a |
| 20 | le450_15b | 2642 | 19 | le450_15b |
| 21 | le450_15c | 3866 | 24 | le450_15c |
| 22 | le450_15d | 3921 | 26 | le450_15d |
| 23 | le450_25a | 3153 | 26 | le450_25a |
| 24 | le450_25b | 3366 | 26 | le450_25b |
| 25 | le450_25c | 4515 | 31 | le450_25c |
| 26 | le450_25d | 4544 | 31 | le450_25d |
| 27 | latin_sqr_10 | 42223 | 109 | latin_sqr_10 |
| 28 | C2000.5 | 132515 | 150 | C2000.5 |
| 29 | C4000.5 | 473234 | 266 | C4000.5 |
| 30 | myciel3 | 21 | 4 | myciel3 |
| 31 | myciel4 | 45 | 5 | myciel4 |
| 32 | myciel5 | 93 | 6 | myciel5 |
| 33 | myciel6 | 189 | 7 | myciel6 |
| 34 | myciel7 | 381 | 8 | myciel7 |
| 35 | anna | 283 | 11 | anna |
| 36 | david | 237 | 11 | david |
| 37 | huck | 243 | 11 | huck |
| 38 | jean | 217 | 10 | jean |
| 39 | queen5.5 | 75 | 5 | queen5.5 |
| 40 | queen6.6 | 150 | 10 | queen6.6 |
| 41 | queen7.7 | 196 | 7 | queen7.7 |
| 42 | queen8.8 | 291 | 9 | queen8.8 |
| 43 | games120 | 443 | 9 | games120 |
| 44 | miles250 | 328 | 9 | miles250 |
| 45 | miles500 | 709 | 20 | miles500 |
| 46 | wap05 | 13680 | 51 | wap05 |
| 47 | wap06 | 13778 | 48 | wap06 |
| 48 | wap07 | 28629 | 51 | wap07 |
| 49 | wap08 | 28896 | 51 | wap08 |
| 50 | qg.order30 | 13950 | 30 | qg.order30 |
| 51 | qg.order40 | 32800 | 40 | qg.order40 |
| 52 | qg.order60 | 110925 | 74 | qg.order60 |
Notes:
1. These instances are available at http://www.info.univ-angers.fr/pub/porumbel/graphs/index.html and http://mat.gsia.cmu.edu/COLOR02 , or can be provided on request to wu@info.univ-angers.fr or hust2007wu@gmail.com.
2. The format of the solution file is as follows:
c1 c2 ... cn
where ci (i=1,...,n) is the color of the ith vertex (n is the total number of vertices and ci={1,2,...,K}).