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