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