b-coloring of Kneser graphs

DOI10.1016/J.DAM.2011.10.022MaRDI QIDQ765331zbMATH OpenOpenAlexFDO

Authors R. Balakrishnan, T. Kavaskar

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

zbMATH Keywords

Kneser graph\(b\)-chromatic number\(b\)-spectrum\(b\)-continuouscolor dominating vertexcolor domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On \(b\)-coloring of the Kneser graphs
• b-continuity and the lexicographic product of graphs
• b-coloring of Cartesian product of odd graphs.
• The \(b\)-continuity of some special corona graphs
• On the b-chromatic number of Kneser graphs

Cites work

• scientific article; zbMATH DE number 1953103 (Why is no real title available?)
• scientific article; zbMATH DE number 1919512 (Why is no real title available?)
• About the b-continuity of graphs
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
• Bounds for the b-chromatic number of some families of graphs
• Kneser's conjecture, chromatic number, and homotopy
• On \(b\)-coloring of the Kneser graphs
• On \(b\)-colorings in regular graphs
• On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
• On the \(b\)-dominating coloring of graphs
• On the b-chromatic number of Kneser graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• Some bounds for the b-chromatic number of a graph
• The b-chromatic number of a graph
• The b-chromatic number of cubic graphs
• n-tuple colorings and associated graphs

Cited in

(19)

• A new coloring theorem of Kneser graphs
• The b-chromatic number and related topics -- a survey
• A note on \(b\)-coloring of Kneser graphs
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
• On \(b\)-coloring of the Kneser graphs
• \(b\)-coloring of the Mycielskian of some classes of graphs
• b-coloring of Cartesian product of odd graphs.
• Colorings of b-simple hypergraphs
• \(b\)-chromatic number of Cartesian product of some families of graphs
• Some results on the the \(b\)-chromatic number in complementary prism graphs
• Graphs with girth at least 8 are b-continuous
• On the b-chromatic number of Kneser graphs
• On the \(b\)-continuity property of graphs
• On the \(b\)-continuity of the lexicographic product of graphs
• The \(b\)-continuity of graphs with large girth
• Häggkvist-Hell graphs: A class of Kneser-colorable graphs
• \(b\)-continuity and partial Grundy coloring of graphs with large girth
• Graphs with large girth are \(b\)-continuous
• The lexicographic product of some chordal graphs and of cographs preserves b-continuity

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

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