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