On the b-chromatic number of Kneser graphs

From MaRDI portal
(Redirected from Publication:968135)




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









This page was built for publication: On the b-chromatic number of Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968135)