Balanced -decompositions of graphs

详细信息	查看全文 | 推荐本文 |

• 作者：Hsiang-Chun Hsu^a ; ^{hchsu0222@gmail.com} ; Gerard Jennhwa Chang^a ; ^b ; ^c ; ^{gjchang@math.ntu.edu.tw}
• 关键词：Balanced k-coloring ; Balanced k-decomposition ; Connectivity ; Tree ; Complete multipartite graphs
• 刊名：Discrete Applied Mathematics
• 出版年：2012
• 期刊代码：46_0166218x
• 类别：cp
• 出版时间：July, 2012
• 卷：160
• 期：10-11
• 页码：1639-1642
• 文件大小：199 K

摘要

For a given integer , a balanced -coloring of a graph is a mapping such that for , where for . The balanced -decomposition number of is the minimum integer with the property that for any balanced -coloring there is a partition such that induces a connected subgraph with and for and . In this paper, we determine for some graphs of high connectivity, trees and complete multipartite graphs.