construct/rlve min chromatic number
construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 18 vertices labelled 0..17 and edge list 0, 1 , 0, 8 , 0, 11 , 0, 16 , 0, 17 , 1, 5 , 1, 8 , 1, 11 , 1, 13 , 1, 14 , 1, 15 , 1, 16 , 2, 3 , 2, 8 , 2, 9 , 2, 12 , 2, 13…
The task
An undirected simple graph has 18 vertices labelled 0..17 and edge list [[0, 1], [0, 8], [0, 11], [0, 16], [0, 17], [1, 5], [1, 8], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [2, 3], [2, 8], [2, 9], [2, 12], [2, 13], [2, 15], [2, 17], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [3, 13], [3, 17], [4, 6], [4, 7], [4,…