Chromatic bounds for the subclasses of $pK_2$-free graphs
Athmakoori Prashant, S. Francis Raj, M. Gokulnath

TL;DR
This paper advances the understanding of chromatic bounds in specific subclasses of $pK_2$-free graphs by providing improved and new $ ext{chi}$-binding functions, including linear and polynomial bounds, for various graph classes.
Contribution
It introduces new and improved $ ext{chi}$-binding functions for subclasses of $pK_2$-free graphs, including linear and polynomial bounds, with alternative proofs for existing classes.
Findings
Improved $ ext{chi}$-binding function for $ ext{ extless}2K_2, K_1 + C_4 ext{ extgreater}$-free graphs.
Linear $ ext{chi}$-binding function for $ extless}2K_2, K_2+P_4 extgreater}$-free graphs.
Polynomial $ ext{chi}$-binding functions for $ extless}pK_2, H extgreater}$-free graphs with $H$ in a specified set.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Limits and Structures in Graph Theory
