Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings

Xiao Zhou, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


The degree-constrained subgraphs decomposition problem, such as anf-coloring, anf-factorization, and a [g,f]-factorization, is to decompose a given graphG=(V,E) to edge-disjoint subgraphs degree-constrained by integer-valued functionsfandgonV. In this paper we show that the problem can be simply reduced to the edge-coloring problem in polynomial-time. That is, for any positive integerk, we give a polynomial-time transformation ofGto a new graph such thatGcan be decomposed to at mostkdegree-constrained subgraphs if and only if the new graph can be edge-colored withkcolors.

Original languageEnglish
Pages (from-to)270-287
Number of pages18
JournalJournal of Combinatorial Theory. Series B
Issue number2
Publication statusPublished - 1999 Mar


Dive into the research topics of 'Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings'. Together they form a unique fingerprint.

Cite this