construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 45 vertices numbered 0..44 and 162 edges: (0,17), (0,20), (0,35), (1,4), (1,6), (1,9), (1,13), (1,17), (1,20), (1,25), (1,35), (1,37), (1,38), (1,40), (2,3), (2,12), (2,14), (2,16), (2,17)…
The task
Graph G with 45 vertices numbered 0..44 and 162 edges: (0,17), (0,20), (0,35), (1,4), (1,6), (1,9), (1,13), (1,17), (1,20), (1,25), (1,35), (1,37), (1,38), (1,40), (2,3), (2,12), (2,14), (2,16), (2,17), (2,18), (2,20), (2,26), (2,27), (3,5), (3,7), (3,8), (3,10), (3,16), (3,37), (3,39), (3,40), (3,43), (4,6), (4,7),…