2018/05/04 by Shaebani, Saeed
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1805.01924
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].