A Linear Algorithm for Finding \boldmath[{g,f }]-Colorings of Partial \boldmath{k }-Trees
X. Zhou
Primary Author
K. Fuse
Additional Author
T. Nishizeki
Additional Author
mixed material
bibliography
New York
Springer New York
2000
monographic
Volume 27, Number 3
en
English
17p
Algorithmica
In an ordinary edge-coloring of a graph each color appears at each vertex v at most once. A
[g; f ]-coloring is a generalized edge-coloring in which each color appears at each vertex v at least g.v/ and
at most f .v/ times, where g.v/ and f .v/ are respectively nonnegative and positive integers assigned to v.
This paper gives a linear-time algorithm to find a [g; f ]-coloring of a given partial k-tree using the minimum
number of colors if there exists a [g; f ]-coloring.
01784617
Portal Perguruan Tinggi
EJ00008
My Library
23
2010-05-20 15:45:19
2010-05-20 15:55:10
machine generated