construct/rlve min harmonious coloring
construct/rlve min harmonious coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 12 vertices labelled 0..11 and edge list 1, 4 , 1, 7 , 1, 10 , 2, 4 , 2, 8 , 3, 4 , 3, 6 , 3, 7 , 5, 8 , 6, 7 , 6, 9 , 6, 10 , 9, 11
The task
An undirected simple graph has 12 vertices labelled 0..11 and edge list [[1, 4], [1, 7], [1, 10], [2, 4], [2, 8], [3, 4], [3, 6], [3, 7], [5, 8], [6, 7], [6, 9], [6, 10], [9, 11]]