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.
CITATION STYLE
Zhou, X., & Nishizeki, T. (1994). Edge-coloring and f-coloring for various classes of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 199–207). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_182
Mendeley helps you to discover research relevant for your work.