World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Solving the b-coloring problem for subdivision-edge neighborhood coronas

    https://doi.org/10.1142/S179383092350009XCited by:1 (Source: Crossref)

    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 sharp bounds are established for the b-chromatic number of subdivision-edge neighborhood coronas of these graphs with any other graph.

    Communicated by Guanghui Wang

    AMSC: 05C15