Bounds for the b-chromatic number of the Mycielskian of some families of graphs.

MaRDI QIDQ2823201zbMATH OpenFDO

Authors R. Balakrishnan, S. Francis Raj

Publication date 6 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

\(b\) chromatic numberhypercubeMycielskiansplit graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• \(b\)-coloring of the Mycielskian of some classes of graphs
• On the b-chromatic number of some graph products
• \(b\)-coloring of the Mycielskian of regular graphs
• \(b\)-chromatic sum of Mycielskian of paths
• The b-chromatic number of some standard graphs

Cited in

(12)

• Symmetry parameters for Mycielskian graphs
• \(b\)-coloring of the Mycielskian of some classes of graphs
• On the \(b\)-chromatic number of regular graphs
• \(b\)-coloring of the Mycielskian of regular graphs
• \(b\)-chromatic sum of Mycielskian of paths
• Bounds for the b-chromatic number of some families of graphs
• The b-chromatic number of some standard graphs
• On the \(b\)-chromatic number of regular graphs without 4-cycle
• Distinguishing generalized Mycielskian graphs
• A lower bound on the chromatic number of Mycielski graphs
• Determining number and cost of generalized Mycielskian graphs
• The \(b\)-chromatic index of a graph

This page was built for publication: Bounds for the \(b\)-chromatic number of the Mycielskian of some families of graphs.

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