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