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.

Recent progress on strong edge-coloring of graphs

    https://doi.org/10.1142/S1793830919500629Cited by:6 (Source: Crossref)

    A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.

    AMSC: 05C15
    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!