Skip to main content
SpringerLink
Log in

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree Δ with max {Δ,9} colors. Thus the coloring is optimal for graphs with maximum degree Δ≥9. Moreover for Δ=4,5,6 we give linear-time algorithms that use Δ+2 colors. These results improve over the algorithms of Chrobak and Yung (J. Algorithms 10:35–51, 1989) and of Chrobak and Nishizeki (J. Algorithms 11:102–116, 1990) which color planar graphs using max {Δ,19} colors in linear time or using max {Δ,9} colors in \(\mathcal{O}(n\log n)\) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chrobak, M., Yung, M.: Fast algorithms for edge-coloring planar graphs. J. Algorithms 10, 35–51 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chrobak, M., Nishizeki, T.: Improved edge-coloring algorithms for planar graphs. J. Algorithms 11, 102–116 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Anal. 3, 25–30 (1964)

    MathSciNet  Google Scholar 

  4. Gabow, H.N., Nishizeki, T., Kariv, O., Leven, D., Terada, O.: Algorithms for edge coloring graphs. Technical Report TR-41/85, Department of Computer Science, Tel Aviv University (1985)

  5. Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(Elog D) time. Combinatorica 21, 5–12 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 85(6), 301–302 (2003)

    Article  MathSciNet  Google Scholar 

  7. Skulrattanakulchai, S.: 4-edge-coloring graphs of maximum degree 3 in linear time. Inf. Process. Lett. 81, 191–195 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Vizing, V.G.: Critical graphs with a given chromatic number. Diskret. Anal. 5, 9–17 (1965)

    MATH  MathSciNet  Google Scholar 

  9. Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree 7 are class I. J. Comb. Theory Ser. B 83, 201–212 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Tait, P.G.: On the coloring of maps. Proc. R. Soc. Edinb. Sect. A 10, 501–503 (1878)

    Google Scholar 

  11. Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the 28th Symposium on Theory of Computing, pp. 571–575. ACM, New York (1996)

    Google Scholar 

  12. Sanders, D.P.: Private communication (2005)

  13. He, X.: An efficient algorithm for edge coloring planar graphs with Δ colors. Theor. Comput. Sci. 74, 299–312 (1990)

    Article  MATH  Google Scholar 

  14. Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, New York University, 251 Mercer Street, New York, NY, 10012, USA

    Richard Cole

  2. Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Łukasz Kowalik

Authors
  1. Richard Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Łukasz Kowalik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Łukasz Kowalik.

Additional information

R. Cole supported in part by NSF grants CCR0105678 and CCF0515127 and IDM0414763.

Ł. Kowalik supported in part by KBN grant 4T11C04425. Part of this work was done while Ł. Kowalik was staying at the Max Planck Institute in Saarbruecken, Germany.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cole, R., Kowalik, Ł. New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica 50, 351–368 (2008). https://doi.org/10.1007/s00453-007-9044-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9044-3

Keywords

Search

Navigation