This article foucuses on (P3∪P2,K4)(P3∪P2,K4)-free graph. In this paper, we prove that if G is (P3∪P2,K4)(P3∪P2,K4)-free, then χ(G)≤7χ(G)≤7. We then use our result to obtain the upper bound of order and chromatic number of (4K1,P3∪P2‾,Kω)(4K1,P3∪P2,Kω)-free graph .
生成讲解博客的中文版本
生成AI智能校验的中文版本