construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 250 vertices numbered 0..249 and 1075 edges: (0,12), (0,31), (0,41), (0,44), (0,87), (0,121), (0,147), (0,155), (0,174), (0,233), (1,50), (1,54), (1,74), (1,80), (1,93), (1,114), (1,136)…
The task
Graph G with 250 vertices numbered 0..249 and 1075 edges: (0,12), (0,31), (0,41), (0,44), (0,87), (0,121), (0,147), (0,155), (0,174), (0,233), (1,50), (1,54), (1,74), (1,80), (1,93), (1,114), (1,136), (1,142), (1,186), (2,7), (2,38), (2,141), (2,182), (2,213), (2,214), (2,218), (3,5), (3,20), (3,24), (3,38), (3,60),…