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