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 141 edges: (0,4), (0,5), (0,31), (0,44), (1,3), (1,8), (1,18), (1,21), (1,33), (2,11), (2,13), (2,22), (2,23), (2,27), (2,30), (2,31), (2,41), (3,6), (3,9)…
The task
Graph G with 45 vertices numbered 0..44 and 141 edges: (0,4), (0,5), (0,31), (0,44), (1,3), (1,8), (1,18), (1,21), (1,33), (2,11), (2,13), (2,22), (2,23), (2,27), (2,30), (2,31), (2,41), (3,6), (3,9), (3,17), (3,21), (3,25), (3,28), (3,35), (3,42), (3,43), (4,6), (4,7), (4,8), (4,11), (4,18), (4,22), (4,27), (4,35),…