TY - GEN
T1 - Edge-coloring and f-coloring for various classes of graphs
AU - Zhou, Xiao
AU - Nishizeki, Takao
N1 - Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.
PY - 1994
Y1 - 1994
N2 - 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 coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.
AB - 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 coloring in which each color appears at each vertex v ε V at most f(v) times. This paper gives efficient sequential and parallel algorithms which find ordinary edge-colorings and f-colorings for various classes of graphs such as bipartite graphs, planar graphs, graphs of fixed genus, partial k-trees, s-degenerate graphs, graphs of fixed arborieity etc.
UR - http://www.scopus.com/inward/record.url?scp=79251487989&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79251487989&partnerID=8YFLogxK
U2 - 10.1007/3-540-58325-4_182
DO - 10.1007/3-540-58325-4_182
M3 - Conference contribution
AN - SCOPUS:79251487989
SN - 9783540583257
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 199
EP - 207
BT - Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
A2 - Du, Ding-Zhu
A2 - Du, Ding-Zhu
A2 - Zhang , Xiang-Sun
PB - Springer Verlag
T2 - 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
Y2 - 25 August 1994 through 27 August 1994
ER -