<?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%">Liu, H.</style></author><author><style face="normal" font="default" size="100%">Sousa, Teresa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Monochromatic K_r-Decompositions of Graphs</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Graph Theory</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://docentes.fct.unl.pt/sites/default/files/tmjs/files/mono-clique-preprint.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">76</style></volume><pages><style face="normal" font="default" size="100%">89-100</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Given graphs G and H, and a coloring of the edges of G with k colors, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let f_{k}(n,H) be the smallest number t such that  any graph G of order n and any coloring  of its edges with k colors,  admits a monochromatic H-decomposition with at most t parts. Here we study the function f_{k}(n,K_r)  for k≥ 2 and r≥ 3.&lt;/p&gt;
</style></abstract></record></records></xml>