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