Solving the b-coloring problem for subdivision-edge neighborhood coronas
Raúl Manuel Falcón Ganfornina, M. Venkatachalam, S. Julie Margaret · Discrete Mathematics Algorithms and Applications · 2023
In this paper, the [Formula: see text]-coloring problem is solved for every subdivision-edge neighborhood corona of paths, cycles, stars and complete graphs. In addition, some exact values and sharp bounds are established for the [Formula: see text]-chromatic number of subdivision-edge neighborhood coronas of these graphs with any other graph.