b-coloring and b-edge coloring of Mesh Graphs and their related graphs
Yue Peng · 2023
In the normal coloring of a graph, if there is at least one vertex in each color class and it has at least one adjacent point in other color classes, such normal coloring is called b - coloring, and such points are called b - points. Let G have the maximum k value of b - k -dyeing called b -chromatic number, which is recorded as φ(G). Similarly, b -edge coloring and the chromatic number of the graph is φ'(G).