construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 100 vertices numbered 0..99 and 400 edges: (0,1), (0,2), (0,7), (0,26), (0,29), (0,40), (0,49), (0,84), (0,87), (0,91), (1,15), (1,55), (1,69), (1,72), (1,79), (1,81), (1,86), (2,4), (2,31)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,1), (0,2), (0,7), (0,26), (0,29), (0,40), (0,49), (0,84), (0,87), (0,91), (1,15), (1,55), (1,69), (1,72), (1,79), (1,81), (1,86), (2,4), (2,31), (2,39), (2,43), (2,86), (3,25), (3,29), (3,45), (3,48), (3,56), (3,57), (3,63), (3,70), (3,71), (3,75), (4,24),…