Abstract
We consider the problem of edge-coloring planar graphs. It is known that a planar graph G with maximum degree Δ ≥ 8 can be colored with Δ colors. We present two algorithms which find such a coloring when Δ ≥ 9. The first one is a sequential O( n log n) time algorithm. The other one is a parallel EREW PRAM algorithm which works in time O(log 3 n) and uses O( n) processors.
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.
