关于无(泛,偶洞)图的结构
On the structure of (pan, even hole)-free graphs
摘要:
一个洞是一个无弦的循环,至少有四个顶点。泛图是由一个洞和一个顶点组成的图,其中洞上只有一个邻居。偶数洞是具有偶数个顶点的洞。证明了无(泛,偶洞)图可以被团割集分解为基本单位圆弧图。这个结构定理是我们的$O(nm)$ -时间证明算法的基础,用于识别(泛,甚至孔)-免费的图形和我们的$O(n^{2.5}+nm)$ -时间算法,以最佳的颜色。利用这个结构定理,我们证明了无(泛,偶洞)图的树宽至多为团数减1的1.5倍,从而色数至多为团数的1.5倍.
英文摘要:
A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a hole with an even number of vertices. We prove that a (pan, even hole)-free graph can be decomposed by clique cutsets into essentially unit circular-arc graphs. This structure theorem is the basis of our $O(nm)$-time certifying algorithm for recognizing (pan, even hole)-free graphs and for our $O(n^{2.5}+nm)$-time algorithm to optimally color them. Using this structure theorem, we show that the tree-width of a (pan, even hole)-free graph is at most 1.5 times the clique number minus 1, and thus the chromatic number is at most 1.5 times the clique number.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。