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