REVIEW 1 cited by
Linear $\chi$-binding functions for $\{P_3\cup P_2, gem\}$-free graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Finding families that admit a linear $\chi$-binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of $2K_2$-free graphs has garnered much attention. In this paper, we are interested in finding a linear subfamily of a specific superclass of $2K_2$-free graphs, namely $(P_3\cup P_2)$-free graphs. We show that the class of $\{P_3\cup P_2,gem\}$-free graphs admits $f=2\omega$ as a linear $\chi$-binding function. Furthermore, we give examples to show that the optimal $\chi$-binding function $f^*\geq \left\lceil\frac{5\omega(G)}{4}\right\rceil$ for the class of $\{P_3\cup P_2, gem\}$-free graphs and that the $\chi$-binding function $f=2\omega$ is tight when $\omega=2$ and $3$.
Forward citations
Cited by 1 Pith paper
-
Coloring of some $(P_2\cup P_4)$-free graphs
For (P2∪P4, gem)-free, (P2∪P4, butterfly)-free, and (P2∪P4, diamond)-free graphs, the paper establishes explicit χ-binding functions, and shows (P2∪P4, diamond, C5)-free graphs with clique number at least 5 are perfect.
Discussion (0). Continue with ORCID to comment.