@article {3110,
	title = {4-cycle Decompositions of Graphs},
	journal = {Open Journal of Discrete Mathematics},
	volume = {2},
	year = {2012},
	pages = {125-130},
	abstract = {<p>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.</p>
},
	url = {http://www.scirp.org/journal/ojdm/},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2012-10-4-cycle.pdf},
	author = {Sousa, Teresa}
}
