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 (2012).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call