Edge-coloring and f-coloring for various classes of graphs

Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

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 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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
EditorsDing-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
PublisherSpringer Verlag
Pages199-207
Number of pages9
ISBN (Print)9783540583257
DOIs
Publication statusPublished - 1994
Event5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China
Duration: 1994 Aug 251994 Aug 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume834 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
Country/TerritoryChina
CityBeijing
Period94/8/2594/8/27

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Edge-coloring and f-coloring for various classes of graphs'. Together they form a unique fingerprint.

Cite this