A Note Related to Graph Theory

2023/09/11 by Li, Jinfeng
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2309.05199

Abstract

This article foucuses on (P₃∪ P₂,K₄)-free graph. In this paper, we prove that if G is (P₃∪ P₂,K₄)-free, then χ(G)≤ 7. We then use our result to obtain the upper bound of order and chromatic number of (4K₁,P₃∪ P₂,K_ω)-free graph .

Related

• Optimal chromatic bound for (P₂∪ P₄, HVN)-free graphs
• Improved chromatic bounds for (P₂∪ P₃)-free graphs
• Square-free graphs with no six-vertex induced path
• (P₂+P₄, K₄-e)-free graphs are nearly ω-colorable
• A tight linear chromatic bound for (P₃∪ P₂, W₄)-free graphs