Note: On the b-chromatic number of Kneser graphs

Authors:
Hossein Hajiabolhassan
Affiliations:
Department of Mathematical Sciences, Shahid Beheshti University, G.C., P.O. Box 1983963113, Tehran, Iran
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 6
Cited 4

The b-chromatic number of a graph

Discrete Applied Mathematics
Some bounds for the b-chromatic number of a graph

Discrete Mathematics
On the b-Chromatic Number of Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On approximating the b-chromatic number

Discrete Applied Mathematics
On the b-dominating coloring of graphs

Discrete Applied Mathematics
On the b-continuity property of graphs

Discrete Applied Mathematics

b-coloring of Kneser graphs

Discrete Applied Mathematics
On the b-chromatic number of regular graphs without 4-cycle

Discrete Applied Mathematics
Note: A note on approximating the b-chromatic number

Discrete Applied Mathematics
b-chromatic numbers of powers of paths and cycles

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this note, we prove that for any integer n=3 the b-chromatic number of the Kneser graph KG(m,n) is greater than or equal to 2@?m2@?n. This gives an affirmative answer to a conjecture of [6].