Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
