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