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