Title of article
A note on -placeable graphs
Author/Authors
?ak، نويسنده , , Andrzej، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
3
From page
2634
To page
2636
Abstract
Let G be a graph of order n . We prove that if the size of G is less than or equal to n − 2 ( k − 1 ) 3 , then the complete graph K n contains k edge-disjoint copies of G . The case k = 2 is well known.
Keywords
k -placement , Packing graph , Edge disjoint
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599769
Link To Document