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