Abstract
The class of -free graphs have been well studied in various contexts in the past. It is known that the class of -free graphs and -free graphs admits a linear -binding function. In this paper, we study the classes of -free graphs which is a superclass of -free graphs. We show that -free graphs and -free graphs also admits linear -binding functions. In addition, we give tight chromatic bounds for -free graphs and -free graphs and it can be seen that the latter is an improvement of the existing bound given by A. P. Bharathi and S. A. Choudum [Colouring of -free graphs, Graphs and Combinatorics 34 (2018), 97-107].
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.