HF RL Explorer

construct/rlve min chromatic number

construct/rlve min chromatic number: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 10 vertices labelled 0..9 and edge list 0, 1 , 0, 5 , 0, 6 , 2, 3 , 2, 7 , 2, 8 , 3, 5 , 3, 8 , 4, 7 , 4, 9 , 7, 9

The task

An undirected simple graph has 10 vertices labelled 0..9 and edge list [[0, 1], [0, 5], [0, 6], [2, 3], [2, 7], [2, 8], [3, 5], [3, 8], [4, 7], [4, 9], [7, 9]]

Part of amphora/MathConstructOptimize-Envs-harbor.