construct/rlve min chromatic number
construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 30 vertices labelled 0..29 and edge list 0, 7 , 0, 9 , 0, 12 , 0, 13 , 0, 14 , 0, 16 , 0, 24 , 0, 25 , 1, 5 , 1, 6 , 1, 10 , 1, 12 , 1, 15 , 1, 19 , 1, 24 , 1, 28 , 2…
The task
An undirected simple graph has 30 vertices labelled 0..29 and edge list [[0, 7], [0, 9], [0, 12], [0, 13], [0, 14], [0, 16], [0, 24], [0, 25], [1, 5], [1, 6], [1, 10], [1, 12], [1, 15], [1, 19], [1, 24], [1, 28], [2, 10], [2, 11], [2, 12], [2, 21], [2, 27], [3, 15], [4, 11], [4, 12], [4, 19], [4, 24], [4, 28], [4,…