construct/rlve max achromatic coloring
construct/rlve max achromatic coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 12 vertices labelled 0..11 and edge list 0, 2 , 0, 3 , 0, 7 , 0, 9 , 1, 3 , 1, 4 , 1, 6 , 1, 7 , 1, 8 , 2, 3 , 2, 4 , 2, 6 , 2, 10 , 3, 7 , 3, 8 , 3, 9 , 3, 11 , 4…
The task
An undirected simple graph has 12 vertices labelled 0..11 and edge list [[0, 2], [0, 3], [0, 7], [0, 9], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 6], [2, 10], [3, 7], [3, 8], [3, 9], [3, 11], [4, 5], [4, 6], [4, 9], [4, 10], [4, 11], [5, 7], [5, 9], [5, 11], [6, 7], [6, 8], [6, 9], [6, 11], [8, 9],…