@inproceedings{1a4fcc6fa9be454492d33b0406dc9d5a,

title = "Algorithms for finding f-colorings of partial k-trees",

abstract = "In an ordinary edge-coloring of a graph G = (V, E) each color appears at each vertex v ϵ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ϵ V at most f(v) times, where f(v) is a positive integer assigned to v. This paper gives a lineax-time sequential algorithm and an optimal parallel algorithm which find an f-coloring of a given-partial k-tree with the minimum number of colors.",

author = "Xiao Zhou and Takao Nishizeki",

year = "1995",

month = jan,

day = "1",

language = "English",

isbn = "3540605738",

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

publisher = "Springer-Verlag",

pages = "332--341",

editor = "Alistair Moffat and John Staples and Naoki Katoh and Peter Eades",

booktitle = "Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings",

note = "6th International Symposium on Algorithms and Computations, ISAAC 1995 ; Conference date: 04-12-1995 Through 06-12-1995",

}