Multiple Coloring of Cone Graphs

doi:10.1137/070691486

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/56752

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/56752

题名:	Multiple Coloring of Cone Graphs
作者:	Pan, Zhishi;Zhu, Xuding
贡献者:	淡江大學數學學系
关键词:	Multiple coloring;Cone graphs;Mycielski graphs;Fractional chromatic number;Kneser graphs
日期:	2010
上传时间:	2011-09-07 11:54:53 (UTC+8)
出版者:	Philadelphia: Society for Industrial and Applied Mathematics
摘要:	A k-fold coloring of a graph assigns to each vertex a set of k colors, and color sets assigned to adjacent vertices are disjoint. The kth chromatic number Xk(G) of a graph G is the minimum total number of colors needed in a k-fold coloring of G. Given a graph G = (V, E) and an integer m ≥ 0, the m-cone of G, denoted by µm(G), has vertex set (V x {0,1,… , m}) U {u} in which u is adjacent to every vertex of V x {m}, and (x, i)(y, j) is an edge if xy ∈ E and i = j = 0 or xy ∈ E and \|i - j\| = 1. This paper studies the kth chromatic number of the cone graphs. An upper bound for Xk(µm(G) in terms of Xk(G), k, and m are given. In particular, it is proved that for any graph G, if m ≥ 2k, then Xk(µm(G)) ≤ Xk(G) + 1. We also find a surprising connection between the kth chromatic number of the cone graph of G and the circular chromatic number of G. It is proved that if Xk(G)/k > Xc((G) and Xk(G) is even, then for sufficiently large m, Xk(µm(G)) = Xk(G). In particular, if X(G) > Xc(G) and X(G) is even, then for sufficiently large m, X(µm(G)) = X(G).
關聯:	SIAM Journal on Discrete Mathematics 24(4), pp.1515-1526
DOI:	10.1137/070691486
显示于类别:	[數學學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
0895-4801_24(4)p1515-1526.pdf	241Kb	Adobe PDF	230	检视/开启
index.html	0Kb	HTML	191	检视/开启
index.html	0Kb	HTML	187	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....