On the b-chromatic number of Kneser graphs
From MaRDI portal
Publication:968135
DOI10.1016/j.dam.2009.09.023zbMath1226.05117arXiv0904.3977MaRDI QIDQ968135
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
05C15: Coloring of graphs and hypergraphs
Related Items
On the \(b\)-chromatic number of regular graphs without 4-cycle, The achromatic number of Kneser graphs, Hedetniemi's conjecture for Kneser hypergraphs, \(b\)-coloring of Kneser graphs, A note on approximating the \(b\)-chromatic number, The \(b\)-chromatic index of graphs, Strengthening topological colorful results for graphs, \(b\)-chromatic numbers of powers of paths and cycles
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