Abstract
Let Δ ≥ 4 be an integer. We prove that every planar graph with maximum degree Δ and girth at least 10Δ +46 is strong (2Δ − 1)-edge-colorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [2] when Δ ≥ 6.
Sign-in/Register to access full text options 
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.
