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