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

zbMATH Open1363.05072MaRDI QIDQ2823201FDOQ2823201

Authors: R. Balakrishnan, S. Francis Raj 

Publication date: 6 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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

zbMATH Keywords

hypercubesplit graphMycielskian\(b\) chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

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

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)