On the choosability of complete multipartite graphs with part size three

Henry Kierstead

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

On the choosability of complete multipartite graphs with part size three

Henry Kierstead

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

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
DOIs	https://doi.org/10.1016/S0012-365X(99)00157-0
State	Published - Jan 28 2000

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

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

Cite this

@article{d631255c7deb4dc9977d5397f7923793,

title = "On the choosability of complete multipartite graphs with part size three",

abstract = "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.",

author = "Henry Kierstead",

year = "2000",

month = jan,

day = "28",

doi = "10.1016/S0012-365X(99)00157-0",

language = "English (US)",

volume = "211",

pages = "255--259",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

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

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

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

M3 - Article

AN - SCOPUS:0042281932

SN - 0012-365X

VL - 211

SP - 255

EP - 259

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On the choosability of complete multipartite graphs with part size three

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this