paper

Chromatic bounds for the subclasses of -free graphs

arXiv:2102.13458

Abstract

The concept of -binding functions for classes of free graphs has been extensively studied in the past. In this paper, we improve the existing -binding function for -free graphs. Also, we find a linear -binding function for -free graphs. In addition, we give alternative proofs for the -binding function of -free graphs, -free graphs and -free graphs. Finally, for , we find polynomial -binding functions for -free graphs where .