construct/rlve min chromatic number
construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 24 vertices labelled 0..23 and edge list 0, 5 , 0, 6 , 0, 8 , 0, 9 , 0, 10 , 0, 11 , 0, 14 , 0, 16 , 0, 17 , 0, 20 , 1, 2 , 1, 3 , 1, 9 , 1, 10 , 1, 11 , 1, 14 , 1, 16…
The task
An undirected simple graph has 24 vertices labelled 0..23 and edge list [[0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 14], [0, 16], [0, 17], [0, 20], [1, 2], [1, 3], [1, 9], [1, 10], [1, 11], [1, 14], [1, 16], [1, 19], [1, 21], [1, 22], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [2, 14], [2, 16], [2,…