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