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