(email)
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.
Related External Link