Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs

详细信息    查看全文

• 作者：Zhidan Yan ; Wei Wang
• 关键词：Equitable coloring ; Equitable chromatic threshold ; Complete multipartite graph ; Kronecker product
• 刊名：Discrete Applied Mathematics
• 出版年：10 January, 2014
• 年：2014
• 卷：162
• 期：Complete
• 页码：328-333
• 全文大小：370 K

文摘

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph , denoted by , is the minimum such that is equitably -colorable. The equitable chromatic threshold of a graph , denoted by , is the minimum such that is equitably -colorable for . In this paper, we give the exact values of and for .