8 citations · 11 across the 14 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 1 cited
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…
math.CO2011
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…