Saeed Shaebani
Published 2018-05-04Version 1
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].
An Upper bound on the chromatic number of circle graphs without $K_4$
The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
![QR code for arXiv:1805.01924 [math.CO]](http://oss.arxitics.com/images/favicon.svg)