construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 37 vertices numbered 0..36 and 133 edges: (0,1), (0,3), (0,6), (0,7), (0,9), (0,18), (0,21), (0,24), (1,7), (1,8), (1,12), (1,13), (1,24), (1,26), (1,28), (2,3), (2,11), (2,15), (2,20)…
The task
Graph G with 37 vertices numbered 0..36 and 133 edges: (0,1), (0,3), (0,6), (0,7), (0,9), (0,18), (0,21), (0,24), (1,7), (1,8), (1,12), (1,13), (1,24), (1,26), (1,28), (2,3), (2,11), (2,15), (2,20), (2,21), (2,22), (2,24), (2,36), (3,11), (3,12), (3,28), (3,29), (3,36), (4,5), (4,14), (4,20), (4,30), (4,35), (5,17),…