关于多边形可见图的着色性
On Colourability of Polygon Visibility Graphs
摘要:
研究了多边形可见图的着色问题。特别地,对于简单多边形的可见图,我们给出了4-着色的多项式算法,并证明了5-着色问题对于它们已经是NP-完全的。对于带洞的多边形可见图,我们证明了4-着色问题是NP-完全的。
英文摘要:
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability question is already NP-complete for them. For visibility graphs of polygons with holes, we prove that the 4-colourability question is NP-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。