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