Skip to main content
SpringerLink
Log in

An efficient algorithm for edge-coloring series parallel multigraphs

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 583))

Included in the following conference series:

  • 137 Accesses

Abstract

Many combinatorial problems can be efficiently solved for series-parallel graphs or partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no efficient algorithms have been obtained for series-parallel multigraphs. This paper gives an algorithm which optimally edge-colors a given series-parallel multigraph in time O(¦V¦Δ), where V is the set of vertices and Δ the maximum degree.

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.

References

  1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, Tech. Rept. 91-36, Laboratoire Bordelais de Recherche en Informatique, Bordeaux, 1991.

    Google Scholar 

  2. S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, Journal of Algorithms, 12, 2, pp.308–340, 1991.

    Google Scholar 

  3. H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, Journal of Algorithms, 11, 4, pp.631–643, 1990.

    Google Scholar 

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

    Google Scholar 

  5. P. D. Seymour, Colouring series-parallel graphs, Combinatorica 10(4), PP-379–392, 1990.

    Google Scholar 

  6. M. Sysło, NP-complete problems on some tree-structured graphs: a review, In M. Nagl and J. Perl, editors, Proc. WG'83 International Workshop on Graph Theoretic Concepts in Comouter Science, pp. 342–353, Univ. Verlag Rudolf Trauner, Linz, West Germany, 1983.

    Google Scholar 

  7. O. Terada and T. Nishizeki, Approximate algorithms for the edge-coloring of graphs, Trans. Inst, of Electronics and Communication Eng. of Japan, J65-D, 11, pp. 1382–1389, 1982.

    Google Scholar 

  8. K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs, J. of ACM, 29, 3, pp. 623–641, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Faculty of Engineering, Tohoku University, Sendai 980, Japan

    X. Zhou, S. Nakano, H. Suzuki & T. Nishizeki

Authors
  1. X. Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. Nishizeki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, X., Nakano, S., Suzuki, H., Nishizeki, T. (1992). An efficient algorithm for edge-coloring series parallel multigraphs. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023853

Download citation

  • DOI: https://doi.org/10.1007/BFb0023853

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation