New bounds for the \(b\)-chromatic number of vertex deleted graphs

DOI10.1016/j.dam.2021.09.023zbMath1483.05061arXiv1904.01600OpenAlexW3205381827MaRDI QIDQ2243141

Renata R. Del-Vecchio, Mekkia Kouider

Publication date: 11 November 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.01600

zbMATH Keywords

girthchordal graphclaw-free graphs\(b\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On quasi-monotonous graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• The \(b\)-chromatic number and related topics -- a survey
• Graphs of girth at least 7 have high \(b\)-chromatic number
• The \(b\)-chromatic index of graphs
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs

This page was built for publication: New bounds for the \(b\)-chromatic number of vertex deleted graphs