Simple reduction of f-colorings to edge-colorings

Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)


In an edge-coloring of a graph G = (V, E) each color appears around each vertex at most once. An f-coloring is a generalization of an edge-coloring in which each color appears around each vertex v at most f(υ) times where f is a function assigning a natural number f(υ) ∊ N to each vertex υ ∊ V. In this paper we first give a simple reduction of the f-coloring problem to the ordinary edge-coloring problem, that is, we show that, given a graph G = (V, E) and a function f: υ → N, one can directly construct in polynomial-time a new simple graph whose edge-coloring using a minimum number of colors immediately induces an f-coloring of G using a minimum number of colors. As by-products, we give a necessary and sufficient condition for a graph to have an f-factorization, and show that the edge-coloring problem for multigraphs can be easily reduced to edge-coloring problems for simple graphs.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings
EditorsDing-Zhu Du, Ming Li, Ding-Zhu Du
PublisherSpringer Verlag
Number of pages6
ISBN (Print)354060216X, 9783540602163
Publication statusPublished - 1995
Event1st Annual International Computing and Combinatorics Conference, COCOON 1995 - Xi’an, China
Duration: 1995 Aug 241995 Aug 26

Publication series

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


Conference1st Annual International Computing and Combinatorics Conference, COCOON 1995


Dive into the research topics of 'Simple reduction of f-colorings to edge-colorings'. Together they form a unique fingerprint.

Cite this