On the choosability of complete multipartite graphs with part size three

Research output: Contribution to journalArticle

29 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)255-259
Number of pages5
JournalDiscrete Mathematics
Volume211
Issue number1-3
StatePublished - Jan 28 2000

Fingerprint

Choosability
Complete multipartite Graph
Erdös
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

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

In: Discrete Mathematics, Vol. 211, No. 1-3, 28.01.2000, p. 255-259.

Research output: Contribution to journalArticle

@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 = "1",
day = "28",
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

M3 - Article

AN - SCOPUS:0042281932

VL - 211

SP - 255

EP - 259

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -