2023/08/17 by Rui Li, Li, Rui, Jinfeng Li +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2308.08768
openalex publication_date 2023/08/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For two vertex disjoint graphs H and F, we use H∪ F to denote the graph with vertex set V(H)∪ V(F) and edge set E(H)∪ E(F), and use H+F to denote the graph with vertex set V(H)∪ V(F) and edge set E(H)∪ E(F)∪\xy | x∈ V(H), y∈ V(F)\. A W4 is the graph K1+C4. In this paper, we prove that χ(G)≤ 2ω(G) if G is a (P3∪ P2, W4)-free graph. This bound is tight when ω=2 and 3, and improves the main result of Wang and Zhang. Also, this bound partially generalizes some results of Prashant \em et al..