%0 Journal Article %J Open Journal of Discrete Mathematics %D 2012 %T 4-cycle Decompositions of Graphs %A Sousa, Teresa %N 4 %P 125-130 %U http://www.scirp.org/journal/ojdm/ %V 2 %X

In this paper we consider the problem of finding the smallest number such that any graph G of order n admits a decomposition into edge disjoint copies of C_4 and single edges with at most elements. We solve this problem for n sufficiently large.

%> https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2012-10-4-cycle.pdf