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