A linear algorithm for edge-coloring partial k-trees

Xiao Zhou, Shln Ichi Nakano, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)


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(nΔ 22(k+1) 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.

Original languageEnglish
Title of host publicationAlgorithms ESA 1993 – 1st Annual European Symposium, Proceedings
EditorsThomas Lengauer
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540572732
Publication statusPublished - 1993
Event1st Annual European Symposium on Algorithms, ESA 1993 - Bad Honnef, Germany
Duration: 1993 Sep 301993 Oct 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume726 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st Annual European Symposium on Algorithms, ESA 1993
CityBad Honnef

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'A linear algorithm for edge-coloring partial k-trees'. Together they form a unique fingerprint.

Cite this