<?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%">Greedy Friendship 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%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.scirp.org/journal/PaperInformation.aspx?paperID=4582</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2011-04-greedy_friendship.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">1 (1)</style></volume><pages><style face="normal" font="default" size="100%">32–34</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for some . We solve the problem of finding the best upper bound for the size of a greedy 2-friendship decomposition and a greedy friendship decomposition of graphs of order n. &lt;/p&gt;
</style></abstract></record></records></xml>