Abstract
We present NC algorithms for vertex and edge coloring planar graphs. The vertex coloring algorithm 5 colors any planar graph, and the edge coloring algorithm Δ edge colors planar graphs with Δ ≥ 23 (and Δ + 1 edge colors planar graphs with Δ < 23), where Δ is the maximum degree in the graph.
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.
