arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.05816math.CO
收藏

Villainy为2的图的特征

Characterization of Graphs with Villainy 2

Sogol Jahanbekam, Meng-Ru Lin

摘要:

设$f$是图$G$的一个最优真染色,$c$是图$G$的顶点的一个染色,它是通过置换真染色$f$中顶点的颜色得到的. $c$的缺点,写作$B(c)$,是必须重新着色的顶点的最小数量,以获得$G$的正确着色,附加条件是每种颜色的使用次数不变。$G$的劣性被定义为在$G$的所有最优适当着色上的$B(G)=max_{c}B(c)$。本文用$B(G)=2$刻画了图$G$.

英文摘要:

Let $f$ be an optimal proper coloring of a graph $G$ and let $c$ be a coloring of the vertices of $G$ obtained by permuting the colors on vertices in the proper coloring $f$. The villainy of $c$, written $B(c)$, is the minimum number of vertices that must be recolored to obtain a proper coloring of $G$ with the additional condition that the number of times each color is used does not change. The villainy of $G$ is defined as $B(G)=max_{c}B(c)$, over all optimal proper colorings of $G$. In this paper, we characterize graphs $G$ with $B(G)=2$.

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

↑