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,21), (0,38), (0,48), (0,49), (0,81), (0,83), (0,171), (0,198), (0,237), (0,249), (1,34), (1,39), (1,42), (1,152), (1,203), (1,248), (2,22)…
The task
Graph G with 250 vertices numbered 0..249 and 1075 edges: (0,21), (0,38), (0,48), (0,49), (0,81), (0,83), (0,171), (0,198), (0,237), (0,249), (1,34), (1,39), (1,42), (1,152), (1,203), (1,248), (2,22), (2,50), (2,52), (2,72), (2,116), (2,160), (2,164), (2,169), (2,229), (2,230), (2,235), (2,249), (3,33), (3,58),…