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