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