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