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

无$(P_5, K_1+(K_1\cup K_3))$图色数的一个紧线性界

A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs

Wei Dong, Baogang Xu, Yian Xu

摘要:

设$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)\}$的图。本文给出了无$(P_5, K_1\cup K_3)$图的一个刻划,证明了$χ(G)\le 2ω(G)-1$若$G$是无$(P_5, K_1\cup K_3)$的.在此基础上,我们进一步证明了$χ(G)\le $ max $\{2ω(G),15\}$,如果$G$是$(P_5,K_1+( K_1\cup K_3))$ -free图,并构造了一个无限族的$(P_5, K_1+( K_1\cup K_3))$ -free图,使得族中的每个图$G$都满足$χ(G)=2ω(G)$ .

英文摘要:

Let $F_1$ and $F_2$ be two disjoint graphs. The union $F_1\cup F_2$ is a graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and the join $F_1+F_2$ is a 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 present a characterization to $(P_5, K_1\cup K_3)$-free graphs, prove that $χ(G)\le 2ω(G)-1$ if $G$ is $(P_5, K_1\cup K_3)$-free. Based on this result, we further prove that $χ(G)\le $max$\{2ω(G),15\}$ if $G$ is a $(P_5,K_1+( K_1\cup K_3))$-free graph, and construct an infinite family of $(P_5, K_1+( K_1\cup K_3))$-free graphs such that every graph $G$ in the family satisfies $χ(G)=2ω(G)$.

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

↑