construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 41 vertices numbered 0..40 and 146 edges: (0,3), (0,6), (0,7), (0,20), (0,21), (1,2), (1,15), (1,21), (1,25), (1,26), (1,32), (1,38), (2,3), (2,7), (2,13), (2,27), (2,28), (2,36), (2,40)…
The task
Graph G with 41 vertices numbered 0..40 and 146 edges: (0,3), (0,6), (0,7), (0,20), (0,21), (1,2), (1,15), (1,21), (1,25), (1,26), (1,32), (1,38), (2,3), (2,7), (2,13), (2,27), (2,28), (2,36), (2,40), (3,11), (3,17), (3,25), (4,5), (4,13), (4,23), (4,26), (4,29), (4,32), (4,38), (4,40), (5,6), (5,11), (5,15), (5,18),…