arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.06944math.CO
收藏

若干不含C₄的图的近似最优着色

Nearly optimal coloring of some C4-free graphs

Ran Chen, Baogang Xu

AI总结:

该研究针对不含C₄及特定禁用子图的图类,通过刻画无团割集和泛团的相关图结构、建立其与Petersen图的关联,证明这类图是χ-polydet的且有近似最优线性绑定函数。

摘要:

若一类图${\frak G}$存在多项式绑定函数$f$,且存在多项式时间算法可对${\frak G}$中的图$G$确定一种$f(ω(G))$-着色,则称该图类是$χ$-polydet(色数多项式可确定)的。设$P_t$和$C_t$分别表示含$t$个顶点的路径和环。bull图(牛头图)由一个三角形加两条不相交的悬挂边构成,hammer图(锤图)通过将$P_3$的一个端点与三角形的一个顶点重合得到,fork⁺图(叉⁺图)由$K_{1,3}$的一条边细分两次得到。设$H$为bull图或hammer图,$F$为$P_7$或fork⁺图。我们确定了所有不含团割集和泛团的不含$(C_3,C_4,F)$的图,并揭示了不含$(C_4,F,H)$的图与Petersen图(彼得森图)之间的紧密联系。作为推论,我们证明不含$(C_4,F,H)$的图类是$χ$-polydet的,且具有近似最优的线性绑定函数。

英文摘要:

A class ${\cal G}$ of graphs is $χ$-{\em polydet} if ${\cal G}$ has a polynomial binding function $f$ and there is a polynomial time algorithm to determine an $f(ω(G))$-coloring of $G\in {\cal G}$. Let $P_t$ and $C_t$ denote a path and a cycle on $t$ vertices, respectively. A {\em bull} consists of a triangle with two disjoint pendant edges, a {\em hammer} is obtained by identifying an end of $P_3$ with a vertex of a triangle, a {\em fork$^+$} is obtained from $K_{1, 3}$ by subdividing an edge twice. Let $H$ be a bull or a hammer, and $F$ be a $P_7$ or a fork$^+$. We determine all $(C_3, C_4, F)$-free graphs without clique cutsets and universal cliques, and present a close relation between $(C_4, F, H)$-free graphs and the Petersen graph. As a consequence, we show that the classes of $(C_4, F, H)$-free graphs are $χ$-polydet with nearly optimal linear binding functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑