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