Solving the -coloring problem for subdivision-edge neighborhood coronas
Abstract
In this paper, the -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 -chromatic number of subdivision-edge neighborhood coronas of these graphs with any other graph.
Communicated by Guanghui Wang