A note on b-coloring of Kneser graphs
Combinatorics
2018-09-18 v2
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].
Keywords
Cite
@article{arxiv.1805.01924,
title = {A note on b-coloring of Kneser graphs},
author = {Saeed Shaebani},
journal= {arXiv preprint arXiv:1805.01924},
year = {2018}
}