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

几类无$P_5$图的色数

On the chromatic number of some $P_5$-free graphs

Wei Dong, Baogang Xu, Yian Xu

摘要:

让$G$是一个图。我们说$G$是完全可分的,如果对于$G$的每个导出子图$H$,$V(H)$可以划分为$A$和$B$,使得$H[A]$是完全的,$ω(H[B])<ω(H)$。我们使用$P_t$和$C_t$分别表示$t$顶点上的路径和循环。对于两个不交图$F_1$和$F_2$,我们用$F_1\cup F_2$表示顶点集为$V(F_1)\cup V(F_2)$、边集为$E(F_1)\cup E(F_2)$的图,用$F_1+F_2$表示顶点集为$V(F_1)\cup V(F_2)$、边集为$E(F_1)\cup E(F_2)\cup \{xy\;|\; x\in V(F_1)\mbox{ and } y\in V(F_2)\}$的图.本文证明了:(i)$(P_5, C_5, K_{2, 3})$ -free图是完全可分的;(ii)$χ(G)\le 2ω^2(G)-ω(G)-3$是完全可分的,如果$G$是$(P_5, K_{2,3})$ -free的,且具有$ω(G)\ge 2$;(iii)$χ(G)\le {3\over 2}(ω^2(G)-ω(G))$是完全可分的,如果$G$是$(P_5, K_1+2K_2)$ -free的;(iv)$χ(G)\le 3ω(G)+11$是完全可分的,如果$G$是$(P_5, K_1+(K_1\cup K_3))$ -free的.

英文摘要:

Let $G$ be a graph. We say that $G$ is perfectly divisible if for each induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. We use $P_t$ and $C_t$ to denote a path and a cycle on $t$ vertices, respectively. For two disjoint graphs $F_1$ and $F_2$, we use $F_1\cup F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and use $F_1+F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)\cup \{xy\;|\; x\in V(F_1)\mbox{ and } y\in V(F_2)\}$. In this paper, we prove that (i) $(P_5, C_5, K_{2, 3})$-free graphs are perfectly divisible, (ii) $χ(G)\le 2ω^2(G)-ω(G)-3$ if $G$ is $(P_5, K_{2,3})$-free with $ω(G)\ge 2$, (iii) $χ(G)\le {3\over 2}(ω^2(G)-ω(G))$ if $G$ is $(P_5, K_1+2K_2)$-free, and (iv) $χ(G)\le 3ω(G)+11$ if $G$ is $(P_5, K_1+(K_1\cup K_3))$-free.

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

↑