On the choosability of complete multipartite graphs with part size three

被引：31

作者：

Kierstead, HA ^{[1
]}

机构：

[1] Arizona State Univ, Dept Math, Tempe, AZ 85287 USA

来源：

DISCRETE MATHEMATICS | 2000年 / 211卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(99)00157-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：255 / 259

页数：5