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