<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sousa, Teresa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">4-cycle Decompositions of Graphs</style></title><secondary-title><style face="normal" font="default" size="100%">Open Journal of Discrete Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.scirp.org/journal/ojdm/</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2012-10-4-cycle.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">125-130</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record></records></xml>