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