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