construct/rlve min chromatic number
construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 30 vertices labelled 0..29 and edge list 0, 1 , 0, 4 , 0, 9 , 0, 18 , 0, 21 , 0, 26 , 1, 3 , 1, 6 , 1, 7 , 1, 13 , 1, 21 , 1, 27 , 2, 10 , 2, 11 , 2, 14 , 2, 19 , 2, 21…
The task
An undirected simple graph has 30 vertices labelled 0..29 and edge list [[0, 1], [0, 4], [0, 9], [0, 18], [0, 21], [0, 26], [1, 3], [1, 6], [1, 7], [1, 13], [1, 21], [1, 27], [2, 10], [2, 11], [2, 14], [2, 19], [2, 21], [2, 22], [3, 5], [3, 6], [3, 15], [3, 16], [3, 18], [3, 20], [3, 29], [4, 7], [4, 13], [4, 18],…