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