On edge-\(b\)-critical graphs

DOI10.1016/J.DAM.2014.08.012zbMath1303.05060OpenAlexW2030353774MaRDI QIDQ476322

Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray

Publication date: 28 November 2014

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

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

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic numberedge \(b\)-critical graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ On b-vertex and b-edge critical graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ A characterization of \(b_e\)-critical trees ⋮ A characterization of edge \(b\)-critical graphs

Cites Work

• The b-chromatic number of a graph
• On vertex b-critical trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On edge-\(b\)-critical graphs