arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0406044cs.CC
收藏

关于强迫色数的计算复杂性

On the Computational Complexity of the Forcing Chromatic Number

Frank Harary, Wolfgang Slany, Oleg Verbitsky

摘要:

我们考虑图的顶点染色,其中相邻的顶点有不同的颜色。一个图是$s$ -色的,如果它可以用$s$颜色着色,并且它的任何着色至少使用$s$颜色。一个$s$ -色图$G$的强迫色数$F(G)$是必须着色的顶点的最小数目,使得在使用$s$颜色的限制下,每个剩余的顶点都有其颜色唯一确定。我们估计的计算复杂性$F(G)$有关它的复杂性类美国介绍的布拉斯和Gurevich。我们证明了识别$F(G)\le 2$是否是US-困难的多项式时间多-一减少。此外,即使承诺$F(G)\le 3$和$G$是3色的,这个问题也是NP困难的。另一方面,识别对于每个常数$k$,$F(G)\le k$是否可通过析取真值表归约在US中归约为问题。对于图的团和控制数的强迫变量也得到了类似的结果。

英文摘要:

We consider vertex colorings of graphs in which adjacent vertices have distinct colors. A graph is $s$-chromatic if it is colorable in $s$ colors and any coloring of it uses at least $s$ colors. The forcing chromatic number $F(G)$ of an $s$-chromatic graph $G$ is the smallest number of vertices which must be colored so that, with the restriction that $s$ colors are used, every remaining vertex has its color determined uniquely. We estimate the computational complexity of $F(G)$ relating it to the complexity class US introduced by Blass and Gurevich. We prove that recognizing if $F(G)\le 2$ is US-hard with respect to polynomial-time many-one reductions. Moreover, this problem is coNP-hard even under the promises that $F(G)\le 3$ and $G$ is 3-chromatic. On the other hand, recognizing if $F(G)\le k$, for each constant $k$, is reducible to a problem in US via disjunctive truth-table reduction. Similar results are obtained also for forcing variants of the clique and the domination numbers of a graph.

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

↑