Linear $\chi$-binding functions for $\{P_3\cup P_2, gem\}$-free graphs
Combinatorics
2023-05-22 v1
Abstract
Finding families that admit a linear -binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of -free graphs has garnered much attention. In this paper, we are interested in finding a linear subfamily of a specific superclass of -free graphs, namely -free graphs. We show that the class of -free graphs admits as a linear -binding function. Furthermore, we give examples to show that the optimal -binding function for the class of -free graphs and that the -binding function is tight when and .
Cite
@article{arxiv.2305.11757,
title = {Linear $\chi$-binding functions for $\{P_3\cup P_2, gem\}$-free graphs},
author = {Athmakoori Prashant and S. Francis Raj and M. Gokulnath},
journal= {arXiv preprint arXiv:2305.11757},
year = {2023}
}