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