On the b-coloring of G - e

DOI10.1016/J.DAM.2015.02.017MaRDI QIDQ2345629zbMATH OpenOpenAlexFDO

Authors Mohamed Zamime, Mekkia Kouider, Hacène Ait Haddadene

Publication date 22 May 2015

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

Full work available at URL https://doi.org/10.1016/j.dam.2015.02.017

zbMATH Keywords

\(b\)-coloringcoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Bounds for the b-chromatic number of subgraphs and edge-deleted subgraphs
• A characterization of edge \(b\)-critical graphs
• Bounds for the b-chromatic number of G-v
• Characterization of some b-chromatic edge critical graphs
• Bounds for the b-chromatic number of induced subgraphs and G - e

Cites work

• b-coloring of some bipartite graphs
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
• Characterization of some b-chromatic edge critical graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph

Cited in

(8)

• New bounds for the \(b\)-chromatic number of vertex deleted graphs
• A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
• b-coloring of some bipartite graphs
• Bounds for the b-chromatic number of G-v
• Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph
• Families of greater b-chromatic graphs
• Some properties on the \(b\)-chromatic number of special graphs
• Bounds for the b-chromatic number of induced subgraphs and G - e

This page was built for publication: On the \(b\)-coloring of \(G - e\)

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