几类无$(P_3\cup P_2)$图的$χ$ -结合函数
$χ$-binding functions for some classes of $(P_3\cup P_2)$-free graphs
摘要:
无$2K_2$图类在过去的各种背景下已经得到了很好的研究。已知$\{2K_2,2K_1+K_p\}$ -free图和$\{2K_2,(K_1\cup K_2)+K_p\}$ -free图类存在线性$χ$ -binding函数.本文研究了$(P_3\cup P_2)$ -free图类,它是$2K_2$ -free图类的一个超类.我们证明了$\{P_3\cup P_2,2K_1+K_p\}$ -free图和$\{P_3\cup P_2,(K_1\cup K_2)+K_p\}$ -free图也允许线性$χ$ -binding函数.此外,我们还给出了$\{P_3\cup P_2,HVN\}$ -free图和$\{P_3\cup P_2,diamond\}$ -free图的紧色界,可以看出后者是A. P. Bharathi和S. A. Choudum [$(P_3\cup P_2)$ -free graphs,Graphs and Combinatorics 34(2018),97-107]。
英文摘要:
The class of $2K_2$-free graphs have been well studied in various contexts in the past. It is known that the class of $\{2K_2,2K_1+K_p\}$-free graphs and $\{2K_2,(K_1\cup K_2)+K_p\}$-free graphs admits a linear $χ$-binding function. In this paper, we study the classes of $(P_3\cup P_2)$-free graphs which is a superclass of $2K_2$-free graphs. We show that $\{P_3\cup P_2,2K_1+K_p\}$-free graphs and $\{P_3\cup P_2,(K_1\cup K_2)+K_p\}$-free graphs also admits linear $χ$-binding functions. In addition, we give tight chromatic bounds for $\{P_3\cup P_2,HVN\}$-free graphs and $\{P_3\cup P_2,diamond\}$-free graphs and it can be seen that the latter is an improvement of the existing bound given by A. P. Bharathi and S. A. Choudum [Colouring of $(P_3\cup P_2)$-free graphs, Graphs and Combinatorics 34 (2018), 97-107].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。