construct/mc graph k coloring
construct/mc graph k coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph G with 20 vertices numbered 0..19 and 30 edges: (0,9), (1,10), (1,11), (1,19), (2,3), (2,6), (3,4), (3,9), (3,19), (4,10), (4,12), (4,13), (4,14), (4,15), (5,10), (5,13), (6,8), (7,8), (8,12)…
The task
Graph G with 20 vertices numbered 0..19 and 30 edges: (0,9), (1,10), (1,11), (1,19), (2,3), (2,6), (3,4), (3,9), (3,19), (4,10), (4,12), (4,13), (4,14), (4,15), (5,10), (5,13), (6,8), (7,8), (8,12), (8,19), (9,11), (10,13), (10,14), (10,19), (11,14), (12,13), (12,18), (12,19), (13,18), (15,17)