A note on k-placeable graphs

作者：Zak Andrzej^*

来源：Discrete Mathematics, 2011, 311(22): 2634-2636.

DOI：10.1016/j.disc.2011.08.002

• Packing graph
• k-placement
• Edge disjoint

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.

• 出版日期2011-11-28