The achromatic indices of the regular complete multipartite graphs (Q1894758): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0207-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004850177 / rank | |||
Normal rank | |||
Latest revision as of 09:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The achromatic indices of the regular complete multipartite graphs |
scientific article |
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
