关于判定图的可区别色数至多为二的复杂性
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
摘要：
最近发表在本刊上的一篇文章[3]指出，当k >= 3时，判定一个图的可区别色数是否至多为k的问题是NP-困难的。当k = 2时，我们考虑这个问题。关于在多项式时间内的可解性问题，我们证明了这个问题至少和图自同构一样难，但不比图同构难。
英文摘要：
In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k = 2. In regards to the issue of solvability in polynomial time, we show that the problem is at least as hard as graph automorphism but no harder than graph isomorphism.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
