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