A linear algorithm for edge-coloring partial k-trees

  • Xiao Zhou
  • Shin-ichi Nakano
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 726)


Many combinatorial problems can be efficiently solved for partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no linear-time algorithm has been obtained for partial k-trees. The best known algorithm solves the problem for partial k-trees G in time \(O\left( {n\Delta ^{2^{2\left( {k + 1} \right)} } } \right)\) where n is the number of vertices and Δ is the maximum degree of G. This paper gives a linear algorithm which optimally edge-colors a given partial k-tree for fixed k.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACPD]
    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. [AL]
    S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, Journal of Algorithms, 12, 2, pp.308–340, 1991.Google Scholar
  3. [B]
    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. [BK]
    H.L. Bodlaender and T. Kloks, Better algorithms for the pathwidth and treewidth of graphs, Proceedings of 18'th International Colloquium on Automata, Languages and Programming, Springer Verlag, Lecture Notes in Computer Science, 510, pp.544–555, Berlin, 1991.Google Scholar
  5. [BPT]
    R.B. Borie, R.G. Parker and C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7, pp.555–581 1992.Google Scholar
  6. [C]
    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
  7. [FW]
    S. Fiorini and R.J. Wilson, Edge-Coloring of Graphs, Pitman, London, 1977.Google Scholar
  8. [HK]
    S. L. Hakimi and O. Kariv, On a generalization of edge-coloring in graphs, Journal of Graph Theory, 10, pp.139–154, 1986.Google Scholar
  9. [Hol]
    I.J. Holyer, The NP-completeness of edge-coloring, SIAM J. on Computing, 10, pp.718–720, 1981.Google Scholar
  10. [Hoo]
    M. Hoover, Complexity, structure, and algorithms for edge-partition problems, Technical Report No. CS90-16, Dept. of Computer Science, The University of New Mexico, 1990.Google Scholar
  11. [NC]
    T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.Google Scholar
  12. [NNS]
    S. Nakano, T. Nishizeki and N. Saito, On the f-coloring multigraphs, IEEE Transactions on Circuits and Systems, Vol. 35, No. 3, pp. 345–353, 1988.Google Scholar
  13. [TN]
    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
  14. [TNS]
    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
  15. [ZSN]
    X. Zhou, H. Suzuki and T. Nishizeki, Sequential and parallel algorithms for edge-coloring series-parallel multigraphs, Proc. of Third IPCO, pp. 129–145, 1993.Google Scholar
  16. [ZNN]
    X. Zhou, S. Nakano and T. Nishizeki, A parallel algorithm for edge-coloring partial k-trees, Tech. Rept. TRECIS 93001, Dept. of Inf. Eng., Tohoku Univ., 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Xiao Zhou
    • 1
  • Shin-ichi Nakano
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Department of System Information Sciences Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations