On the equitable chromatic number of complete n-partite graphs

Authors
Lam, PCB Shiu, WC Tong, CS Zhang, ZF
Citation
Pcb. Lam et al., On the equitable chromatic number of complete n-partite graphs, DISCR APP M, 113(2-3), 2001, pp. 307-310
Citations number
8
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE APPLIED MATHEMATICS → ACNP
Volume
113
Issue
2-3
Year of publication
2001
Pages
307 - 310
Database
ISI
SICI code
Abstract
In this note, we derive an explicit formula for the equitable chromatic num ber of a complete n-partite graph Kp(1),p(2),....,p(n). Namely, if M is the largest integer such that p(i) (mod M) < [pi/M] (i = 1, 2,...,n) then chie(Kp(1),p(2),...,p(n)) = Sigma (i=1 n) [pi/M + 1], where chi (e)(G) is the equitable chromatic number of graph G. (C) 2001 Els evier Science B.V. All rights reserved.