construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 33 vertices numbered 0..32 and 76 edges: (0,4), (0,5), (0,13), (0,18), (0,27), (0,31), (1,15), (1,17), (2,4), (2,12), (2,14), (2,15), (2,16), (2,29), (3,5), (3,7), (3,8), (3,17), (3,19)…
The task
Graph G with 33 vertices numbered 0..32 and 76 edges: (0,4), (0,5), (0,13), (0,18), (0,27), (0,31), (1,15), (1,17), (2,4), (2,12), (2,14), (2,15), (2,16), (2,29), (3,5), (3,7), (3,8), (3,17), (3,19), (3,22), (4,5), (4,6), (4,13), (4,24), (4,25), (4,28), (4,31), (6,12), (6,13), (6,14), (6,15), (6,18), (6,19), (6,22),…