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