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