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