construct/rlve min chromatic number
construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 10 vertices labelled 0..9 and edge list 0, 3 , 0, 4 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 1, 3 , 1, 4 , 1, 5 , 1, 8 , 1, 9 , 2, 3 , 2, 4 , 2, 6 , 2, 7 , 2, 9 , 3, 6 , 3, 7 , 3…
The task
An undirected simple graph has 10 vertices labelled 0..9 and edge list [[0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [2, 3], [2, 4], [2, 6], [2, 7], [2, 9], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [4, 7], [4, 8], [4, 9], [5, 6], [5, 9], [6, 7], [7, 8], [7, 9]]