TY - JOUR
T1 - On the equitable chromatic number of complete n-partite graphs
AU - Lam, Peter Che Bor
AU - SHIU, Wai Chee
AU - TONG, Chong Sze
AU - Zhang, Zhong Fu
N1 - Funding Information:
This work was partially supported by RGC, Hong Kong, and FRG, Hong Kong Baptist University.
PY - 2001/10/15
Y1 - 2001/10/15
N2 - 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 thatpi(modM)iM(i=1,2,...,n)thenχ e(Kp1,p2,...,pn)=∑i=1np iM+1,where χe(G) is the equitable chromatic number of graph G.
AB - 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 thatpi(modM)iM(i=1,2,...,n)thenχ e(Kp1,p2,...,pn)=∑i=1np iM+1,where χe(G) is the equitable chromatic number of graph G.
KW - 05C15
KW - 68Q20
KW - Complete n-partite graphs
KW - Equitable chromatic number
UR - http://www.scopus.com/inward/record.url?scp=0035887930&partnerID=8YFLogxK
U2 - 10.1016/S0166-218X(00)00296-1
DO - 10.1016/S0166-218X(00)00296-1
M3 - Journal article
AN - SCOPUS:0035887930
SN - 0166-218X
VL - 113
SP - 307
EP - 310
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 2-3
ER -