Title of article
On graph decompositions modulo k
Author/Authors
A.D. Scott، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
3
From page
289
To page
291
Abstract
We prove that, for every integer k ⩾ 2, every graph has an edge-partition into 5k2 log k sets, each of which is the edge-set of a graph with all degrees congruent to 1 modk. This answers a question of Pyber.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951657
Link To Document