The achromatic indices of the regular complete multipartite graphs (Q1894758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The achromatic indices of the regular complete multipartite graphs |
scientific article; zbMATH DE number 778524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The achromatic indices of the regular complete multipartite graphs |
scientific article; zbMATH DE number 778524 |
Statements
The achromatic indices of the regular complete multipartite graphs (English)
0 references
27 November 1995
0 references
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.
0 references
multipartite graphs
0 references
complete edge colourings
0 references
achromatic indices
0 references
