

![0_image_0.png](0_image_0.png)

![0_image_1.png](0_image_1.png)

rsrs
in [27] assumes that the number of colors required for the coloring is known a priori, that is, the algorithm must be run for a pre-fixed number of colors. When graphs are large and chromatic numbers are unknown, such an algorithm is not practical. Anyway, FrogSim and the algorithm from [27] behave very similarly for most instances, with some exceptions: for hexagon**-based** instances, FrogSim is not quite able to match the average results obtained by the algorithm from [27]. Moreover, concerning icosahedron.col**, the best solution by FrogSim is uses one**
color more than the best one by Lee's algorithm. On the other side, concerning 4-partite4-diff-sizes.col and dodecahedron.col**, FrogSim improves over the average results obtained by**
Lee's algorithm.