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