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 144 edges: (0,7), (0,11), (0,12), (0,39), (0,42), (0,46), (1,3), (1,8), (1,9), (1,20), (1,26), (1,30), (1,33), (1,48), (2,8), (2,17), (2,24), (2,27), (2,32)…
The task
Graph G with 50 vertices numbered 0..49 and 144 edges: (0,7), (0,11), (0,12), (0,39), (0,42), (0,46), (1,3), (1,8), (1,9), (1,20), (1,26), (1,30), (1,33), (1,48), (2,8), (2,17), (2,24), (2,27), (2,32), (2,39), (3,10), (3,16), (3,22), (3,25), (3,27), (3,30), (3,33), (3,43), (3,49), (4,21), (4,23), (5,11), (5,17),…