Title of article
On the equitable chromatic number of complete n-partite graphs
Author/Authors
Peter Che Bor Lam، نويسنده , , Wai Chee Shiu، نويسنده , , Chong Sze Tong، نويسنده , , Zhong Fu Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
307
To page
310
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 thatpi (mod M)
Keywords
Equitable chromatic number , Complete n-partite graphs
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885282
Link To Document