Abstract
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. Let G be a connected planar graph with girth k≥26 and maximum degree Δ. We show that either G is isomorphic to a subgraph of a very special Δ-regular graph with girth k, or G has a strong edge-coloring using at most 2Δ+⌈12(Δ−2)k⌉ colors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
