On b-vertex and b-edge critical graphs

DOI10.7494/OPMATH.2015.35.2.171zbMATH Open1328.05064OpenAlexW2114366976MaRDI QIDQ3459012FDOQ3459012

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

\(b\)-coloringcritical graphs\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic graph theory and perfect graphs
• The b-chromatic number of a graph
• On the \(b\)-chromatic number of regular graphs
• On vertex \(b\)-critical trees
• On edge-\(b\)-critical graphs
• The b-chromatic number of cubic graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• Some bounds for the \(b\)-chromatic number of a graph
• About the b-continuity of graphs
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• On \(b\)-colorings in regular graphs
• The \(b\)-chromatic number of regular graphs via the edge-connectivity
• \(B\)-chromatic number of cacti
• On \(b\)-coloring of Cartesian product of graphs.

Cited In (7)

• Edge-critical subgraphs of Schrijver graphs. II: The general case
• On edge-\(b\)-critical graphs
• A characterization of \(b_e\)-critical trees
• Title not available (Why is that?)
• On the critical difference of almost bipartite graphs
• On vertex \(b\)-critical trees
• A characterization of edge \(b\)-critical graphs

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

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