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