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