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