Chromatic bounds for the subclasses of pK2-free graphs
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 \2K2, K1 + C4\-free graphs. Also, we find a linear -binding function for \2K2, K2+P4\-free graphs. In addition, we give alternative proofs for the -binding function of \2K2,gem\-free graphs, \2K2,HVN\-free graphs and \2K2, K5-e\-free graphs. Finally, for p≥3, we find polynomial -binding functions for \pK2, H\-free graphs where H∈ \gem, diamond, K2+P4, HVN, K5-e, butterfly, gem+, dart, K1 + C4, C4, P5\.
0