arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.08166math.COcs.DM
收藏

关于不含诱导子图 $P_5$ 或 $K_5-e$ 的图

On graphs with no induced $P_5$ or $K_5-e$

Arnab Char, T. Karthick

AI总结:

本文研究 $(P_5,K_5-e)$-无关图的结构与色数界,证明高团数连通图的团割集或二部补图性质,并给出 $\chi(G)\leq\max\{7,\omega(G)\}$,推出该图类色数问题可多项式时间求解。

摘要:

本文研究与 $(P_5,K_5-e)$-无关图类的色数和团数相关的若干问题,并证明以下结论。$(a)$ 若 $G$ 是满足 $\omega(G)\geq 7$ 的连通 $(P_5,K_5-e)$-无关图,则 $G$ 要么是二部图的补图,要么具有团割集。此外,存在一个连通的 $(P_5,K_5-e)$-无关非完美图 $H$,满足 $\omega(H)=6$ 且没有团割集。这加强了 Malyshev 和 Lobanova 的结果[Disc. Appl. Math. 219 (2017) 158--166]。$(b)$ 若 $G$ 是满足 $\omega(G)\geq 4$ 的 $(P_5,K_5-e)$-无关图,则 $\chi(G)\leq \max\{7,\omega(G)\}$。此外,当 $\omega(G)\notin\{4,5,6\}$ 时,该界是紧的。该结果与已知结果共同部分回答了 Ju 和 Huang 的问题[arXiv:2303.18003 [math.CO] 2023],并改进了 Xu 的结果[手稿 2022]。尽管已知“色数问题”对 $P_5$-无关图类是 $NP$-难的,但我们的结果与一些已知结果表明,“色数问题”对 $(P_5,K_5-e)$-无关图类可在多项式时间内求解,这一点本身可能具有意义。

英文摘要:

In this paper, we are interested in some problems related to chromatic number and clique number for the class of $(P_5,K_5-e)$-free graphs, and prove the following. $(a)$ If $G$ is a connected ($P_5,K_5-e$)-free graph with $ω(G)\geq 7$, then either $G$ is the complement of a bipartite graph or $G$ has a clique cut-set. Moreover, there is a connected ($P_5,K_5-e$)-free imperfect graph $H$ with $ω(H)=6$ and has no clique cut-set. This strengthens a result of Malyshev and Lobanova [Disc. Appl. Math. 219 (2017) 158--166]. $(b)$ If $G$ is a ($P_5,K_5-e$)-free graph with $ω(G)\geq 4$, then $χ(G)\leq \max\{7, ω(G)\}$. Moreover, the bound is tight when $ω(G)\notin \{4,5,6\}$. This result together with known results partially answers a question of Ju and Huang [arXiv:2303.18003 [math.CO] 2023], and also improves a result of Xu [Manuscript 2022]. While the "Chromatic Number Problem" is known to be $NP$-hard for the class of $P_5$-free graphs, our results together with some known results imply that the "Chromatic Number Problem" can be solved in polynomial time for the class of ($P_5,K_5-e$)-free graphs which may be independent interest.

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

↑