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