On the b-chromatic number of Kneser graphs

DOI10.1016/j.dam.2009.09.023zbMath1226.05117arXiv0904.3977OpenAlexW2091676640MaRDI QIDQ968135

Hossein Hajiabolhassan

Publication date: 5 May 2010

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

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

zbMATH Keywords

chromatic numberb-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Strengthening topological colorful results for graphs, The \(b\)-chromatic number and related topics -- a survey, On the \(b\)-chromatic number of regular graphs without 4-cycle, A note on approximating the \(b\)-chromatic number, \(b\)-chromatic numbers of powers of paths and cycles, A note on \(b\)-coloring of Kneser graphs, The achromatic number of Kneser graphs, Hedetniemi's conjecture for Kneser hypergraphs, \(b\)-coloring of Kneser graphs, Some results on the b-chromatic number in complementary prism graphs, Achromatic numbers of Kneser graphs, The \(b\)-chromatic index of graphs

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On \(b\)-coloring of the Kneser graphs
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• Some bounds for the \(b\)-chromatic number of a graph
• On the \(b\)-continuity property of graphs
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item