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, 3 , 0, 5 , 0, 6 , 0, 7 , 1, 2 , 1, 8 , 2, 8 , 3, 8 , 5, 8 , 5, 9 , 6, 7

The task

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

Part of amphora/MathConstructOptimize-Envs-harbor.