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