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