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