construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 50 vertices numbered 0..49 and 188 edges: (0,14), (0,15), (0,25), (0,29), (0,30), (0,43), (0,44), (0,49), (1,2), (1,21), (1,24), (1,28), (1,36), (2,7), (2,16), (2,20), (2,22), (2,29), (2,30)…
The task
Graph G with 50 vertices numbered 0..49 and 188 edges: (0,14), (0,15), (0,25), (0,29), (0,30), (0,43), (0,44), (0,49), (1,2), (1,21), (1,24), (1,28), (1,36), (2,7), (2,16), (2,20), (2,22), (2,29), (2,30), (2,36), (2,41), (2,47), (2,49), (3,10), (3,13), (3,17), (3,18), (3,30), (3,44), (4,6), (4,13), (4,18), (4,28),…