On the Chromatic Number of Some ( P 3 ∪ P 2 )-Free Graphs

Rui Li (), Jinfeng Li and Di Wu
Additional contact information
Rui Li: School of Mathematics, Hohai University, Nanjing 211100, China
Jinfeng Li: School of Mathematics, Hohai University, Nanjing 211100, China
Di Wu: School of Mathematical Science, Nanjing Normal University, Nanjing 210046, China

Mathematics, 2023, vol. 11, issue 19, 1-8

Abstract: Let G be a graph. We denote the chromatic (clique) number of G by χ ( G ) ( ω ( G ) ) . In this paper, we prove that (i) χ ( G ) ≤ 2 ω ( G ) if G is ( P 3 ∪ P 2 , kite)-free, (ii) χ ( G ) ≤ ω 2 ( G ) if G is ( P 3 ∪ P 2 , hammer)-free, (iii) χ ( G ) ≤ 3 ω 2 ( G ) + ω ( G ) 2 if G is ( P 3 ∪ P 2 , C 5 )-free. Furthermore, we also discuss the chromatic number of ( P 3 ∪ P 2 , K 4 )-Free Graphs.

Keywords: chromatic number; clique number; ? -binding function; (P 3 ? P 2 )-free graphs (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/19/4031/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/19/4031/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:19:p:4031-:d:1245784

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().