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,11), (0,24), (0,42), (0,53), (0,59), (0,71), (0,76), (0,84), (0,85), (0,96), (1,2), (1,18), (1,24), (1,39), (1,42), (1,53), (1,58), (1,71)…
The task
Graph G with 100 vertices numbered 0..99 and 400 edges: (0,11), (0,24), (0,42), (0,53), (0,59), (0,71), (0,76), (0,84), (0,85), (0,96), (1,2), (1,18), (1,24), (1,39), (1,42), (1,53), (1,58), (1,71), (1,90), (1,94), (2,5), (2,32), (2,38), (2,41), (2,73), (2,96), (3,8), (3,9), (3,12), (3,26), (3,31), (3,50), (3,61),…