On the choosability of complete multipartite graphs with part size three (Q1969804): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)00157-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014373569 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the choosability of complete multipartite graphs with part size three |
scientific article |
Statements
On the choosability of complete multipartite graphs with part size three (English)
0 references
15 September 2000
0 references
Let \(K_{m*r}\) be the complete \(r\)-partite graph with \(m\) vertices in each part. \textit{P. Erdős, A. L. Rubin} and \textit{H. Taylor} [Combinatorics, graph theory and computing, Proc. West Coast Conf., Arcata/Calif. 1979, 125-157 (1980; Zbl 0469.05032)] showed that \(K_{2*r}\) is \(r\)-choosable and suggested the problem of determining the choosability of \(K_{m*r}\). The author of the present paper proves that \(K_{3*r}\) is exactly \(\lceil(4r-1)/3 \rceil\)-choosable.
0 references
complete \(r\)-partite graphs
0 references
choosability
0 references
