A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://pdfs.semanticscholar.org/a743/1fb011118dbfe4a5ebd48275e09b0b55fa7d.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Filters
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings
<span title="">1999</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a>
</i>
In this paper we show that the problem can be simply reduced to the edge-coloring problem in polynomial-time. ...
The degree-constrained subgraphs decomposition problem, such as an f-coloring, an f-factorization, and a [ g, f ]-factorization, is to decompose a given graph G=(V, E) to edge-disjoint subgraphs degree-constrained ...
In this paper we show that the degree-constrained subgraphs decomposition problem can be simply reduced to the edge-coloring problem in polynomial time. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jctb.1998.1883">doi:10.1006/jctb.1998.1883</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/etxdchk3grd4rdty4mznkr33eu">fatcat:etxdchk3grd4rdty4mznkr33eu</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190302180000/http://pdfs.semanticscholar.org/a743/1fb011118dbfe4a5ebd48275e09b0b55fa7d.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/43/a7431fb011118dbfe4a5ebd48275e09b0b55fa7d.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jctb.1998.1883">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
Publisher / doi.org
</button>
</a>