construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 59 vertices numbered 0..58 and 235 edges: (0,11), (0,12), (0,15), (0,18), (0,23), (0,28), (0,36), (0,43), (0,51), (0,58), (1,7), (1,11), (1,13), (1,35), (1,53), (1,55), (2,5), (2,10), (2,22)…
The task
Graph G with 59 vertices numbered 0..58 and 235 edges: (0,11), (0,12), (0,15), (0,18), (0,23), (0,28), (0,36), (0,43), (0,51), (0,58), (1,7), (1,11), (1,13), (1,35), (1,53), (1,55), (2,5), (2,10), (2,22), (2,24), (2,28), (2,32), (2,33), (2,46), (2,50), (2,55), (3,12), (3,21), (3,34), (3,54), (3,55), (3,57), (3,58),…