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