construct/rlve min harmonious coloring
construct/rlve min harmonious coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 10 vertices labelled 0..9 and edge list 0, 3 , 0, 6 , 0, 9 , 1, 5 , 1, 9 , 2, 5 , 2, 7 , 3, 4 , 4, 5 , 4, 6 , 6, 7 , 6, 8 , 8, 9
The task
An undirected simple graph has 10 vertices labelled 0..9 and edge list [[0, 3], [0, 6], [0, 9], [1, 5], [1, 9], [2, 5], [2, 7], [3, 4], [4, 5], [4, 6], [6, 7], [6, 8], [8, 9]]