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