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

Xiao Zhou, Takao Nishizeki

研究成果: Article査読

1 被引用数 (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.

本文言語English
ページ(範囲)270-287
ページ数18
ジャーナルJournal of Combinatorial Theory. Series B
75
2
DOI
出版ステータスPublished - 1999 3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

フィンガープリント 「Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル