construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 53 vertices numbered 0..52 and 174 edges: (0,3), (0,22), (0,33), (0,35), (0,38), (0,41), (0,50), (1,7), (1,9), (1,30), (1,33), (1,41), (2,3), (2,6), (2,9), (2,22), (2,27), (2,32), (2,38)…
The task
Graph G with 53 vertices numbered 0..52 and 174 edges: (0,3), (0,22), (0,33), (0,35), (0,38), (0,41), (0,50), (1,7), (1,9), (1,30), (1,33), (1,41), (2,3), (2,6), (2,9), (2,22), (2,27), (2,32), (2,38), (2,39), (2,40), (2,46), (2,51), (2,52), (3,27), (3,29), (3,51), (4,9), (4,16), (4,17), (4,22), (4,37), (4,41),…