English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In 1987, A. Gy\'arf\'as in his paper ``Problems from the world surroundingperfect graphs'' posed the problem of determining the smallest $\chi$-bindingfunction for $\mathcal{G}(F,\overline{F})$, when $\mathcal{G}(F)$ is$\chi$-bounded. So far the problem has been attempted for only forest $F$ withfour or five vertices. In this paper, we address the case when $F=P_3\cup 2K_1$and show that if $G$ is a $\{P_3\cup 2K_1,\overline{P_3\cup 2K_1}\}$-free graphwith $\omega(G)\neq 3$, then it admits $\omega(G)+1$ as a $\chi$-bindingfunction. Moreover, we also construct examples to show that this bound is tightfor all values of $\omega\neq 3$.

An optimal chromatic bound for the class of $\{P_3\cup 2K_1,\overline{P_3\cup 2K_1}\}$-free graphs