Abstract: We present some results on the harmonious colourings of the Levi graph of a 2-design, focusing on Steiner 2-design. It is easily seen that the harmonious chromatic number of such a Levi graph is at least the number of points of the design: we study and construct Banff designs, that is designs such that this lower bound is attained.Keywords: Harmonious chromatic number, Levi graph, combinatorial designPublished in RUP: 03.11.2025; Views: 301; Downloads: 5 Full text (426,74 KB)
