@inproceedings{8949b71ec50548bea8d0319fd8e63e33,

title = "An efficient algorithm for edge-coloring series parallel multigraphs",

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.",

author = "X. Zhou and S. Nakano and H. Suzuki and T. Nishizeki",

year = "1992",

month = jan,

day = "1",

doi = "10.1007/BFb0023853",

language = "English",

isbn = "9783540552840",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "516--529",

editor = "Imre Simon",

booktitle = "LATIN 1992 - 1st Latin American Symposium on Theoretical Informatics, Proceedings",

note = "1st International Symposium on Latin American Theoretical Informatics, LATIN 1992 ; Conference date: 06-04-1992 Through 10-04-1992",

}