Simple reduction of f-colorings to edge-colorings
- 137 Downloads
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(v) times where f is a function assigning a natural number f(v) ∈ N to each vertex v ∈ 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: V → 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.
KeywordsBipartite Graph Simple Graph Multiple Edge Factorization Problem Span Subgraph
Unable to display preview. Download preview PDF.
- 1.J. Akiyama and M. Kano. Factors and factorizations of graphs — a survey. Journal of Graph Theory, 9:1–42, 1985.Google Scholar
- 2.M-C. Cai. Private communication, 1995.Google Scholar
- 3.S. Fiorini and R. J. Wilson. Edge-Colourings of Graphs. Pitman, London, 1977.Google Scholar
- 4.S. L. Hakimi and O. Kariv. On a generalization of edge-coloring in graphs. Journal of Graph Theory, 10:139–154, 1986.Google Scholar
- 7.W. T. Tutte. A short proof of the factor theorem for finite graphs. Canad. J. Math., 6:347–352, 1954.Google Scholar
- 8.V. G. Vizing. On an estimate of the chromatic class of a p-graph. Discret Analiz, 3:25–30, 1964.Google Scholar
- 9.X. Zhou and T. Nishizeki. Edge-coloring and f-coloring for various classes of graphs. In Proc. of the Fifth International Symposium on Algorithms and Computation, Lect. Notes in Computer Science, Springer-Verlag, 834:199–207, 1994.Google Scholar