1 problem
Girãо, Hurley, Illingworth, and Michel's conjecture. The graph is -abundant if and only if there is an -colouring of such that is -abundant.
Girãо, Hurley, Illingworth, and Michel's conjecture. The graph is -abundant if and only if there is an -colouring of such that is -abundant.