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