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