arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.5757cs.DM
收藏

网和反网的最优k重着色

Optimal k-fold colorings of webs and antiwebs

Manoel Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio C. Santos

摘要:

图的k重x染色是指从集合{1,2,.,x},使得任何两个相邻顶点被分配不相交的颜色集合。使得G允许k重x染色的最小数x是G的第k色数,记为χ_k(G)。当G是网或反网时,我们确定了这个参数的精确值。我们的结果推广了已知的奇圈的相应结果,并基于团、分数色数和色数给出了χ k(G)达到上、下界的充分必要条件.此外,我们将χ-临界图的概念推广到χ_k-临界图。我们识别具有这种性质的网和反网,对于每个整数k <= 1。

英文摘要:

A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The smallest number x such that G admits a k-fold x-coloring is the k-th chromatic number of G, denoted by χ_k(G). We determine the exact value of this parameter when G is a web or an antiweb. Our results generalize the known corresponding results for odd cycles and imply necessary and sufficient conditions under which χ_k(G) attains its lower and upper bounds based on the clique, the fractional chromatic and the chromatic numbers. Additionally, we extend the concept of χ-critical graphs to χ_k-critical graphs. We identify the webs and antiwebs having this property, for every integer k <= 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑