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