<?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%">Decompositions of graphs into 5-cycles and other small graphs</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Journal of Combinatorics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.combinatorics.org/Volume_12/PDF/v12i1r49.pdf</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2005-09-5-cycle.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">R49, 7 pp.</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;If H is a family of graphs, then an H-decomposition of a graph G is a partition of the edges of G each element of which induces a copy of a graph in G.&lt;br /&gt;
   This paper addresses the problem of finding the number φ(n,H), the smallest number k such that every graph on n vertices has an H-decomposition with at most k elements. φ(n,H) is found in the cases when H={K2,C5}; when H={K2,C5+e}, where e is a chord of the C5; when H={K2,K4−e}; and when H={K2,K3+e}, where e is a pendant edge added to one vertex in the K3. &lt;/p&gt;
</style></abstract></record></records></xml>