1994 | ReviewPaper | Buchkapitel
Edge-coloring and f-coloring for various classes of graphs
verfasst von : Xiao Zhou, Takao Nishizeki
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 arboricity etc.