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