### Abstract

Let K_{m*r} be the complete r-partite graph with m vertices in each part. Erdos, Rubin, and Taylor showed that K_{2*r} is r-choosable and suggested the problem of determining the choosability of K_{m*r}. We show that K_{3*r} is exactly [(4r - 1)/3] choosable.

Original language | English (US) |
---|---|

Pages (from-to) | 255-259 |

Number of pages | 5 |

Journal | Discrete Mathematics |

Volume | 211 |

Issue number | 1-3 |

State | Published - Jan 28 2000 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*211*(1-3), 255-259.

**On the choosability of complete multipartite graphs with part size three.** / Kierstead, Henry.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 211, no. 1-3, pp. 255-259.

}

TY - JOUR

T1 - On the choosability of complete multipartite graphs with part size three

AU - Kierstead, Henry

PY - 2000/1/28

Y1 - 2000/1/28

N2 - Let Km*r be the complete r-partite graph with m vertices in each part. Erdos, Rubin, and Taylor showed that K2*r is r-choosable and suggested the problem of determining the choosability of Km*r. We show that K3*r is exactly [(4r - 1)/3] choosable.

AB - Let Km*r be the complete r-partite graph with m vertices in each part. Erdos, Rubin, and Taylor showed that K2*r is r-choosable and suggested the problem of determining the choosability of Km*r. We show that K3*r is exactly [(4r - 1)/3] choosable.

UR - http://www.scopus.com/inward/record.url?scp=0042281932&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042281932&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0042281932

VL - 211

SP - 255

EP - 259

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -