S. Loudni. "Intensification/Diversification VNS for Graph Coloring Problem". JFPC 2011.

Best results obtained by ID-VNS algorithm in the above paper. 

InstancesBest KID-VNS coloringColoring results
DSJC250.5 28 28 DSJC250.5
DSJC250.9 72 72 DSJC250.9
DSJC500.1 12 12 DSJC500.1
DSJC500.5 48 48 DSJC500.5
DSJC500.9 126 126 DSJC500.9
DSJC1000.1 20 21 DSJC1000.1
DSJC1000.5 83 86 DSJC1000.5
DSJC1000.9 224 224 DSJC1000.9
DSJR500.1c 85 85 DSJR500.1c
DSJR500.5 122 124 DSJR500.5
le450_15c 15 15 le450_15c
le450_15d 15 15 le450_15d
le450_25c 25 26 le450_25c
le450_25d 25 26 le450_25d
flat300_26_0 26 26 flat300_26_0
flat300_28_0 28 29 flat300_28_0
flat1000_50_0 50 50 flat1000_50_0
flat1000_60_0 60 60 flat1000_60_0
flat1000_76_0 82 86 flat1000_76_0
latin_square_10 98 100 latin_square_10

Format of the solution file :