On the \(b\)-chromatic number of regular bounded graphs

DOI10.1016/j.dam.2015.04.017zbMath1316.05037arXiv1302.4209OpenAlexW300596656MaRDI QIDQ2355753

El Sahili Amine, Kouider Mekkia, Mortada Maidoun

Publication date: 24 July 2015

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

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

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic numberproper coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The \(b\)-chromatic number and related topics -- a survey ⋮ The \(b\)-continuity of graphs with large girth ⋮ On quasi-monotonous graphs ⋮ The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs ⋮ On the b-coloring of tight graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for the \(b\)-chromatic number of \(G-v\)
• The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs
• On \(b\)-colorings in regular graphs
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• \(b\)-chromatic number of Cartesian product of some families of graphs
• On the \(b\)-chromatic number of regular graphs
• On the \(b\)-dominating coloring of graphs

This page was built for publication: On the \(b\)-chromatic number of regular bounded graphs