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