A note on b-coloring of Kneser graphs
Saeed Shaebani
TL;DR
This paper presents an improved upper bound for the b-chromatic number of Kneser graphs, refining previous results and contributing to the understanding of graph coloring properties.
Contribution
It introduces a tighter upper bound for the b-chromatic number of Kneser graphs, advancing the theoretical knowledge in graph coloring.
Findings
Improved upper bound for b-chromatic number of Kneser graphs
Refinement over previous bounds by Balakrishnan and Kavaskar
Contributes to theoretical understanding of graph coloring
Abstract
In this short note, the purpose is to provide an upper bound for the b-chromatic number of Kneser graphs. Our bound improves the upper bound that was presented by Balakrishnan and Kavaskar in [b-coloring of Kneser graphs, Discrete Appl. Math. 160 (2012), 9-14].
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.