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,13), (0,21), (0,25), (0,29), (0,40), (0,53), (0,57), (0,66), (0,77), (1,8), (1,9), (1,14), (1,49), (1,57), (1,67), (1,75), (1,89), (1,97), (2,11)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,13), (0,21), (0,25), (0,29), (0,40), (0,53), (0,57), (0,66), (0,77), (1,8), (1,9), (1,14), (1,49), (1,57), (1,67), (1,75), (1,89), (1,97), (2,11), (2,36), (2,52), (2,55), (2,64), (2,79), (3,17), (3,39), (3,43), (3,65), (3,75), (3,76), (3,77), (3,92), (4,28),…