在线色数是PSPACE完全的
Online Chromatic Number is PSPACE-Complete
摘要：
在在线图着色问题中，来自图G的顶点（预先已知）以在线方式到达，并且算法必须立即为每个进入的顶点v分配颜色，使得所揭示的图被正确地着色。图G中v的确切位置对于算法来说是未知的。G的在线色数是最小的颜色数，使得某些在线算法能够为任何传入的命令正确地着色G。证明了图的在线色数的计算是PSPACE-完全的。
英文摘要：
In the online graph coloring problem, vertices from a graph G, known in advance, arrive in an online fashion and an algorithm must immediately assign a color to each incoming vertex v so that the revealed graph is properly colored. The exact location of v in the graph G is not known to the algorithm. The online chromatic number of G is the smallest number of colors such that some online algorithm is able to properly color G for any incoming order. We prove that computing the online chromatic number of a graph is PSPACE-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
