The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs

Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider +1

The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largest positive integer $k$ such that there exists a proper coloring for G with $k$ colors in which every color…