1 paper
Agnijo Banerjee, Lawrence Hollom
A balanced colouring of a graph is one in which every colour appears the same number of times. Given a fixed graph H on r vertices and a balanced k-colouring of the complete…