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