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