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