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