Decomposition of graphs into cycles of length seven and single edges

作者：Sousa Teresa^*

来源：Ars Combinatoria, 2015, 119: 321-329.

Given graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. Let phi(H)(n) be the smallest number phi such that any graph G of order n admits an H-decomposition with at most phi parts. Here we study the case when H = C-7, that is, the cycle of length 7 and prove that phi C-7(n) = left perpendicular n(2)/4 right perpendicular for all n >= 10.

• 出版日期2015-1