On b-vertex and b-edge critical graphs

DOI10.7494/OpMath.2015.35.2.171zbMath1328.05064OpenAlexW2114366976MaRDI QIDQ3459012

Mostafa Blidia, Noureddine Ikhlef Eschouf

Publication date: 29 December 2015

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2015.35.2.171

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A characterization of \(b_e\)-critical trees ⋮ A characterization of edge \(b\)-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(b\)-chromatic number of regular graphs via the edge-connectivity
• On edge-\(b\)-critical graphs
• The b-chromatic number of cubic graphs
• On \(b\)-colorings in regular graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• Some bounds for the \(b\)-chromatic number of a graph
• Algorithmic graph theory and perfect graphs
• On the \(b\)-chromatic number of regular graphs
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• b-chromatic number of cacti
• On vertex b-critical trees
• About the b-continuity of graphs

This page was built for publication: On b-vertex and b-edge critical graphs