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