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