construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 250 vertices numbered 0..249 and 1075 edges: (0,38), (0,68), (0,79), (0,119), (1,40), (1,100), (1,108), (1,121), (1,147), (1,160), (1,172), (1,182), (1,225), (2,9), (2,10), (2,41), (2,74)…
The task
Graph G with 250 vertices numbered 0..249 and 1075 edges: (0,38), (0,68), (0,79), (0,119), (1,40), (1,100), (1,108), (1,121), (1,147), (1,160), (1,172), (1,182), (1,225), (2,9), (2,10), (2,41), (2,74), (2,94), (2,96), (2,191), (2,222), (2,239), (3,21), (3,40), (3,42), (3,52), (3,79), (3,80), (3,82), (3,90), (3,97),…