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