Skip to main content
Springer Nature Link
Log in

Algorithms for Finding Distance-Edge-Colorings of Graphs

  • Conference paper
Computing and Combinatorics (COCOON 2005)

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

Included in the following conference series:

  • 1884 Accesses

Abstract

For a bounded integer ℓ, we wish to color all edges of a graph G so that any two edges within distance ℓ have different colors. Such a coloring is called a distance-edge-coloring or an ℓ-edge-coloring of G. The distance-edge-coloring problem is to compute the minimum number of colors required for a distance-edge-coloring of a given graph G. A partial k-tree is a graph with tree-width bounded by a fixed constant k. We first present a polynomial-time exact algorithm to solve the problem for partial k-trees, and then give a polynomial-time 2-approximation algorithm for planar graphs.

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. Agnarsson, G., Halldórson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16, 651–662 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. Assoc. Comput. Mach. 40, 1134–1164 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41, 153–180 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 11, 631–643 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Computing 25, 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7, 555–581 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on treedecomposable graphs. Theoretical Computer Science 109, 49–82 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Diestel, R.: Graph Theory. Springer, New York (1997)

    MATH  Google Scholar 

  12. Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Computing 10, 718–720 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mahdian, M.: On the computational complexity of strong edge coloring. Discrete Applied Mathematics 118, 239–248 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Salavatipour, M.R.: A polynomial time algorithm for strong edge coloring of partial k-trees. Discrete Applied Mathematics 143, 285–291 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-coloring of partial k-trees. IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences E83-A, 671–678 (2000)

    Google Scholar 

  16. Zhou, X., Nakano, S., Nishizeki, T.: Edge-coloring partial k-trees. J. Algorithms 21, 598–617 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai, 980-8579, Japan

    Takehiro Ito, Akira Kato, Xiao Zhou & Takao Nishizeki

Authors
  1. Takehiro Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Kato
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiao Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takao Nishizeki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ito, T., Kato, A., Zhou, X., Nishizeki, T. (2005). Algorithms for Finding Distance-Edge-Colorings of Graphs. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_81

Download citation

  • DOI: https://doi.org/10.1007/11533719_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics