construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 50 vertices numbered 0..49 and 160 edges: (0,2), (0,34), (1,4), (1,6), (1,15), (1,16), (1,26), (1,29), (1,33), (1,37), (1,38), (1,40), (1,48), (2,8), (2,10), (2,12), (2,15), (2,16), (2,25)…
The task
Graph G with 50 vertices numbered 0..49 and 160 edges: (0,2), (0,34), (1,4), (1,6), (1,15), (1,16), (1,26), (1,29), (1,33), (1,37), (1,38), (1,40), (1,48), (2,8), (2,10), (2,12), (2,15), (2,16), (2,25), (2,32), (2,35), (3,7), (3,9), (3,13), (3,18), (3,33), (3,36), (3,41), (3,45), (4,9), (4,14), (4,23), (4,25),…