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