Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

In this note, we derive an explicit formula for the equitable chromatic number of a complete n-partite graph Kp1,p2,…,pn. Namely, if M is the largest integer such that

then

where χe(G) is the equitable chromatic number of graph G.

Keywords

Complete n-partite graphs, Equitable chromatic number

Publication Date

2001

Source Publication Title

Discrete Applied Mathematics

Volume

113

Issue

1-3

Start Page

307

End Page

310

Publisher

Elsevier

Peer Reviewed

1

DOI

10.1016/S0166-218X(00)00296-1

Link to Publisher's Edition

http://dx.doi.org/10.1016/S0166-218X(00)00296-1

ISSN (print)

0166218X

Included in

Mathematics Commons

Share

COinS