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