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,14), (0,23), (0,59), (0,60), (0,72), (0,89), (0,92), (0,95), (0,97), (1,13), (1,16), (1,36), (1,49), (1,93), (1,98), (2,4), (2,30), (2,32)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,14), (0,23), (0,59), (0,60), (0,72), (0,89), (0,92), (0,95), (0,97), (1,13), (1,16), (1,36), (1,49), (1,93), (1,98), (2,4), (2,30), (2,32), (2,34), (2,45), (2,48), (2,56), (2,66), (3,57), (3,66), (3,73), (3,93), (4,14), (4,18), (4,33), (4,51), (4,84), (5,12),…