The achromatic indices of the regular complete multipartite graphs (Q1894758): Difference between revisions

The problem posed by \textit{A. Bouchet} [Cah. Cent. Étud. Rech. Opér. 20, 331-340 (1978; Zbl 0404.05026)] is solved. The authors use properties of finite projective planes and construction techniques of design theory to construct complete edge colourings of the regular complete \(n\)-partite graphs with each partite set consisting of \(m\) vertices. So they obtain achromatic indices of infinitely many graphs.