arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.20752math.CO
收藏

图的多数C-着色

Majority C-coloring of graphs

Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Institute of Mathematics, Physics and Mechanics, Ljubljana(卢布尔雅那数学、物理与力学研究所)

Csilla Bujtas, Magda Dettlaff, Hanna Furmanczyk, Aleksandra Laskowska

AI总结:

研究图的多数C-着色,定义其色数并分析其性质,证明色数上界及不同图类中的结果,探讨色数与经典色数的关系及决策问题复杂性。

摘要:

受多数着色和C-着色启发,本文引入并研究图的多数C-着色。在这样的顶点着色中,每个顶点的颜色至少与一半的邻居共享。图G的多数C-着色所用最大颜色数称为多数C-色数,记为mc(G)。证明了mc(G)的上界与图的阶数、最小度数和最大度数有关,并通过不同图类的结果展示其有效性。特别地,对于路径和环的k次幂,mc(P_n^k)=mc(C_n^k)=⌊n/(k+1)⌋成立。此外,对于无claw和无K_4的立方图,若包含d个钻石,则mc(G)=(n-d)/3。进一步表明多数C-色数在边删除下不单调。确定了n个顶点图G中mc(G)=k时的边数最小最大值。指出经典色数χ(G)与mc(G)不可比,且两者的差值可为正负整数。另一方面,对于阶数为n的图G,有mc(G)+χ(G)≤n+1。判断mc(G)≥k的问题对每个固定k≥2都是NP难的。相比之下,证明了某些关于mc(G)≥2的充分条件,并给出一个线性时间算法以确定树T的多数C-色数。

英文摘要:

Inspired by the majority colorings and C-colorings, we introduce and study the majority C-coloring of graphs. In such a vertex coloring, every vertex shares its color with at least half of its neighbors. The maximum number of colors that can be used in a majority C-coloring of a graph $G$ is called the majority C-chromatic number and denoted by $\mc(G)$. An upper bound on $\mc(G)$ is proved in terms of the order, minimum, and maximum degree. Its sharpness is demonstrated by several results over different graph classes. In particular, $\mc(P_n^k)= \mc(C_n^k)= \lfloor n/(k+1)\rfloor$ is true for the $k$-th power of a path and a cycle if $n \ge k+1$. Further, $\mc(G) = (n-d)/3$ holds if $G$ is a $(\mbox{claw}, K_4)$-free cubic graph and contains $d$ diamonds. %claw-free cubic graph on $n \ge 6$ vertices and contains $d$ diamonds. It is further shown that the majority C-chromatic number is not monotone under edge deletion. In fact, both the lower and upper bounds are sharp in the inequality chain $\mc(G)-2 \leq \mc(G-e) \leq \mc(G) +1$. The minimum and maximum number of edges in an $n$-vertex graph $G$ with $\mc(G)=k$ are determined for every $n$ and $k$. It is also pointed out that the classical chromatic number $χ(G)$ and $\mc(G)$ are incomparable, and the difference $\mc(G)-χ(G)$ can take any positive or negative integer. On the other hand, $\mc(G)+χ(G) \leq n+1$ holds for every graph $G$ of order $n$. The decision problem of whether $\mc(G) \ge k$ holds is NP-complete for every fixed $k\ge 2$. In contrast, some sufficient conditions for $\mc(G) \ge 2$ are proved, and a linear-time algorithm is presented that determines $\mc(T)$ if $T$ is a tree.

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

↑