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