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