\(b\)-coloring of Kneser graphs
From MaRDI portal
Publication:765331
DOI10.1016/j.dam.2011.10.022zbMath1237.05065OpenAlexW1983141456MaRDI QIDQ765331
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.022
Kneser graph\(b\)-chromatic number\(b\)-spectrum\(b\)-continuouscolor dominating vertexcolor domination
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Graphs with girth at least 8 are b-continuous, The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity, The \(b\)-chromatic number and related topics -- a survey, \(b\)-continuity and partial Grundy coloring of graphs with large girth, The \(b\)-continuity of graphs with large girth, On the \(b\)-continuity of the lexicographic product of graphs, A note on \(b\)-coloring of Kneser graphs, Graphs with large girth are \(b\)-continuous, \(b\)-chromatic number of Cartesian product of some families of graphs, Some results on the b-chromatic number in complementary prism graphs, \(b\)-coloring of the Mycielskian of some classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The b-chromatic number of cubic graphs
- Kneser's conjecture, chromatic number, and homotopy
- On the b-chromatic number of Kneser graphs
- On \(b\)-colorings in regular graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On \(b\)-coloring of the Kneser graphs
- n-tuple colorings and associated graphs
- The b-chromatic number of a graph
- Some bounds for the \(b\)-chromatic number of a graph
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- On b-continuity Of Kneser Graphs of type KG(2k+1,k)
- Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
- About the b-continuity of graphs
