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, 3 , 0, 4 , 0, 5 , 0, 6 , 0, 8 , 0, 9 , 0, 10 , 1, 2 , 1, 5 , 1, 6 , 1, 8 , 1, 10 , 2, 5 , 2, 8 , 2, 11 , 3, 6 , 3, 7 , 3…
The task
An undirected simple graph has 12 vertices labelled 0..11 and edge list [[0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [1, 2], [1, 5], [1, 6], [1, 8], [1, 10], [2, 5], [2, 8], [2, 11], [3, 6], [3, 7], [3, 8], [4, 8], [4, 9], [4, 10], [5, 6], [5, 9], [5, 10], [5, 11], [6, 7], [6, 8], [7, 9], [7, 11], [8,…