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