construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 51 vertices numbered 0..50 and 185 edges: (0,1), (0,2), (0,7), (0,10), (0,21), (0,23), (0,27), (0,38), (0,43), (0,44), (1,2), (1,7), (1,11), (1,13), (1,14), (1,18), (1,21), (1,22), (1,23)…
The task
Graph G with 51 vertices numbered 0..50 and 185 edges: (0,1), (0,2), (0,7), (0,10), (0,21), (0,23), (0,27), (0,38), (0,43), (0,44), (1,2), (1,7), (1,11), (1,13), (1,14), (1,18), (1,21), (1,22), (1,23), (1,32), (1,36), (2,14), (2,21), (2,30), (3,8), (3,12), (3,15), (3,19), (3,22), (3,23), (3,27), (3,28), (3,30),…