8 citations · 9 across the 4 of their papers we have counts for
4 papers
The b-Chromatic Number of Regular Graphs via The Edge Connectivity
Saeed Shaebani
\noindent The b-chromatic number of a graph , denoted by , is the largest integer that admits a proper coloring by colors, such that each color class has a ver…
On The b-Chromatic Number of Regular Graphs Without 4-Cycle
Saeed Shaebani
The b-chromatic number of a graph , denoted by , is the largest integer that admits a proper -coloring such that each color class has a vertex that is adjacent…
About Fall Colorings of Graphs
Saeed Shaebani
A fall -coloring of a graph is a proper -coloring of such that each vertex of sees all colors on its closed neighborhood. In this paper, we answer some questi…
On Fall Colorings of Graphs
Saeed Shaebani
A fall -coloring of a graph is a proper -coloring of such that each vertex of sees all colors on its closed neighborhood. We denote the set of…