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