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