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,2), (0,23), (0,33), (0,61), (0,87), (1,26), (1,36), (1,52), (1,63), (1,71), (1,76), (1,79), (1,85), (1,97), (2,28), (2,42), (2,45), (2,95), (3,6)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,2), (0,23), (0,33), (0,61), (0,87), (1,26), (1,36), (1,52), (1,63), (1,71), (1,76), (1,79), (1,85), (1,97), (2,28), (2,42), (2,45), (2,95), (3,6), (3,13), (3,15), (3,27), (3,31), (3,33), (3,58), (4,12), (4,17), (4,21), (4,34), (4,42), (4,58), (4,85), (4,88),…