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 65 edges: (0,2), (0,8), (0,22), (0,31), (1,4), (1,8), (1,15), (1,23), (2,4), (2,28), (2,31), (3,7), (3,17), (3,18), (3,21), (3,26), (4,24), (5,6), (5,13)…
The task
Graph G with 32 vertices numbered 0..31 and 65 edges: (0,2), (0,8), (0,22), (0,31), (1,4), (1,8), (1,15), (1,23), (2,4), (2,28), (2,31), (3,7), (3,17), (3,18), (3,21), (3,26), (4,24), (5,6), (5,13), (5,15), (5,18), (6,13), (6,15), (6,21), (6,24), (6,27), (6,29), (7,9), (7,16), (7,19), (7,24), (8,16), (8,20), (8,23),…