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