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