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

($P_2+P_4$, $K_4-e$)-free 图几乎是 $\omega$-可染色的

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable

C. U. Angeliya, T. Karthick, Shenwei Huang

AI总结:

本文证明 ($P_2+P_4$, $K_4-e$)-free 图满足 $\chi(G)\leq \max\{6,\omega(G)\}$,且当 $\omega(G)=4$ 时 $\chi(G)=4$,推广了已知结果并改进了现有界。

摘要:

对于图 $G$,$\chi(G)$ 和 $\omega(G)$ 分别表示 $G$ 的色数和团数。本文证明以下结果:(i) 若 $G$ 是 ($P_2+P_4$, $K_4-e$)-free 图且 $\omega(G)\geq 3$,则 $\chi(G)\leq \max\{6, \omega(G)\}$,且该界对每个 $\omega(G)\notin \{4,5\}$ 是紧的。(ii) 若 $G$ 是 ($P_2+P_4$, $K_4-e$)-free 图且 $\omega(G)= 4$,则 $\chi(G)= 4$。这些结果推广了已知的 ($P_2+P_2$, $K_4-e$)-free 图类和 ($P_2+P_3$, $K_4-e$)-free 图类的色数界,改进了 Chen 和 Zhang [arXiv:2412.14524 [math.CO], 2024] 对 ($P_2+P_4$, $K_4-e$)-free 图类给出的界,部分回答了 Ju 和第三作者 [Theor. Comp. Sci. 993 (2024) 文章编号:114465] 关于“近最优可染色图”的问题,以及 Schiermeyer(未发表)关于 ($P_7$, $K_4-e$)-free 图色数界的问题。

英文摘要:

For a graph $G$, $χ(G)$ and $ω(G)$ respectively denote the chromatic number and clique number of $G$. In this paper, we show the following results: (i) If $G$ is a ($P_2+P_4$, $K_4-e$)-free graph with $ω(G)\geq 3$, then $χ(G)\leq \max\{6, ω(G)\}$, and the bound is tight for each $ω(G)\notin \{4,5\}$. (ii) If $G$ is a ($P_2+P_4$, $K_4-e$)-free graph with $ω(G)= 4$, then $χ(G)= 4$. These results extend the chromatic bounds known for the class of ($P_2+P_2$, $K_4-e$)-free graphs and for the class of ($P_2+P_3$, $K_4-e$)-free graphs, improve the bound of Chen and Zhang [arXiv:2412.14524 [math.CO], 2024] given for the class of ($P_2+P_4$, $K_4-e$)-free graphs, partially answer a question of Ju and the third author [Theor. Comp. Sci. 993 (2024) Article No.: 114465] on `near optimal colorable graphs', and a question of Schiermeyer (unpublished) on the chromatic bound for ($P_7$, $K_4-e$)-free graphs.

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

↑