construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 100 vertices numbered 0..99 and 400 edges: (0,1), (0,10), (0,17), (0,23), (0,44), (0,48), (0,51), (0,68), (0,85), (1,17), (1,37), (1,80), (1,83), (1,92), (2,7), (2,10), (2,13), (2,63), (2,64)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,1), (0,10), (0,17), (0,23), (0,44), (0,48), (0,51), (0,68), (0,85), (1,17), (1,37), (1,80), (1,83), (1,92), (2,7), (2,10), (2,13), (2,63), (2,64), (2,92), (3,25), (3,27), (3,42), (3,53), (3,92), (3,94), (4,8), (4,19), (4,25), (4,26), (4,48), (4,54), (4,63),…