A note on b-coloring of Kneser graphs

DOI10.1016/J.DAM.2018.09.013MaRDI QIDQ1730264zbMATH OpenOpenAlexWikidataFDO

Authors Saeed Shaebani

Publication date 11 March 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.01924

zbMATH Keywords

\(b\)-chromatic number\(b\)-coloringKneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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].

Recommendations

• On \(b\)-coloring of the Kneser graphs
• b-coloring of Kneser graphs
• On the b-chromatic number of Kneser graphs
• A new coloring theorem of Kneser graphs
• A note on fall colorings of Kneser graphs
• Note on k-chromatic graphs
• On total and edge coloring some Kneser graphs
• scientific article; zbMATH DE number 798646
• The multichromatic numbers of some Kneser graphs
• On generalized Kneser hypergraph colorings

Cites work

• b-coloring of Kneser graphs
• scientific article; zbMATH DE number 1953103 (Why is no real title available?)
• On \(b\)-coloring of the Kneser graphs
• On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
• On the b-chromatic number of Kneser graphs
• The b-chromatic number and related topics -- a survey
• The b-chromatic number of a graph

Cited in

(4)

• On \(b\)-coloring of the Kneser graphs
• A new coloring theorem of Kneser graphs
• On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
• On the b-chromatic number of Kneser graphs

This page was built for publication: A note on \(b\)-coloring of Kneser graphs

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