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