Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs

DOI10.7151/DMGT.1913zbMath1350.05035OpenAlexW2482257018MaRDI QIDQ339486

Mohammad Hasan, M. Dambrine

Publication date: 11 November 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1913

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for the \(b\)-chromatic number of \(G-v\)
• \(b\)-colouring outerplanar graphs with large girth
• The b-chromatic number of cubic 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
• About the b-continuity of graphs

This page was built for publication: Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs