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