Skip to main content
Springer Nature Link
Log in

Improved Edge-Coloring with Three Colors

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4271))

Included in the following conference series:

  • 776 Accesses

Abstract

We show an O(1.344n)=O(20.427 n) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2n/2) algorithm of Beigel and Eppstein [1]. We extend a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and conquer” technique.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289n). J. Algorithms 54(2), 168–204 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Eppstein, D.: The traveling salesman problem for cubic graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 307–318. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 781–790 (2004)

    Google Scholar 

  4. Fomin, F.: Personal communication (2006)

    Google Scholar 

  5. Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination – a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: A simple O(20.288n) independent set algorithm. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 18–25 (2006)

    Google Scholar 

  7. Fomin, F., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters 97(5), 191–196 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lawler, E.L.: A note on the complexity of the chromatic number problem. Information Processing Letters (5), 66–67 (1976)

    Google Scholar 

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

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Warsaw, Poland

    Łukasz Kowalik

  2. Max-Planck-Institute für Informatik, Saarbrücken, Germany

    Łukasz Kowalik

Authors
  1. Łukasz Kowalik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalik, Ł. (2006). Improved Edge-Coloring with Three Colors. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_9

Download citation

  • DOI: https://doi.org/10.1007/11917496_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48381-6

  • Online ISBN: 978-3-540-48382-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics