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