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, 1 , 0, 3 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 0, 10 , 0, 15 , 0, 16 , 0, 17 , 0, 19 , 0, 21 , 0, 25 , 0, 26 , 0, 28 , 1, 4 , 1, 10…
The task
An undirected simple graph has 30 vertices labelled 0..29 and edge list [[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 15], [0, 16], [0, 17], [0, 19], [0, 21], [0, 25], [0, 26], [0, 28], [1, 4], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 21], [1, 22], [1, 24], [1, 26], [2, 7], [2, 9],…