关于着色点可见图
On colouring point visibility graphs
摘要:
本文证明了可以在多项式时间内判定给定点集的可见图是否为4-色图,并且如果存在4-色图,也可以在多项式时间内构造出4-色图。证明了判定点集的可见图是否为5-列图的问题是NP-完全的。我们给出了一个点可见图的例子,它的色数为6,而它的团数只有4。
英文摘要:
In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。