[PDF][PDF] Determining the b-chromatic number of subdivision-vertex neighbourhood coronas.
RM Falcón, M Venkatachalam… - Analele Stiintifice ale …, 2024 - sciendo.com
Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper,
we determine the b-chromatic number of every subdivision-vertex neighbourhood corona …
we determine the b-chromatic number of every subdivision-vertex neighbourhood corona …
Solving the -coloring problem for subdivision-edge neighborhood coronas
RM Falcón, M Venkatachalam… - Discrete Mathematics …, 2024 - World Scientific
In this paper, the b-coloring problem is solved for every subdivision-edge neighborhood
corona of paths, cycles, stars and complete graphs. In addition, some exact values and …
corona of paths, cycles, stars and complete graphs. In addition, some exact values and …