construct/rlve min harmonious coloring
construct/rlve min harmonious coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 8 vertices labelled 0..7 and edge list 0, 4 , 0, 6 , 1, 3 , 1, 7 , 2, 4 , 2, 5 , 3, 7
The task
An undirected simple graph has 8 vertices labelled 0..7 and edge list [[0, 4], [0, 6], [1, 3], [1, 7], [2, 4], [2, 5], [3, 7]]