construct/nppc three coloring
construct/nppc three coloring: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Graph with 60 vertices labelled 0..59 and edge list 0, 1 , 0, 16 , 0, 24 , 0, 32 , 0, 41 , 0, 48 , 1, 2 , 1, 37 , 1, 45 , 1, 51 , 1, 52 , 1, 55 , 2, 8 , 2, 13 , 2, 30 , 2, 42 , 2, 59 , 3, 6 , 3, 10 , 3, 30…
The task
Graph with 60 vertices labelled 0..59 and edge list [[0, 1], [0, 16], [0, 24], [0, 32], [0, 41], [0, 48], [1, 2], [1, 37], [1, 45], [1, 51], [1, 52], [1, 55], [2, 8], [2, 13], [2, 30], [2, 42], [2, 59], [3, 6], [3, 10], [3, 30], [3, 32], [3, 43], [3, 59], [4, 28], [4, 30], [4, 31], [4, 52], [5, 21], [5, 32], [5, 51],…