construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 34 vertices numbered 0..33 and 111 edges: (0,8), (0,12), (0,21), (0,28), (0,29), (0,30), (0,33), (1,17), (1,28), (1,31), (2,6), (2,18), (2,21), (2,26), (3,12), (3,18), (3,23), (3,33), (4,17)…
The task
Graph G with 34 vertices numbered 0..33 and 111 edges: (0,8), (0,12), (0,21), (0,28), (0,29), (0,30), (0,33), (1,17), (1,28), (1,31), (2,6), (2,18), (2,21), (2,26), (3,12), (3,18), (3,23), (3,33), (4,17), (4,19), (4,20), (4,21), (4,22), (4,24), (4,28), (4,32), (5,6), (5,10), (5,17), (5,19), (5,28), (6,16), (6,20),…