@article {sousa:greedy-fsdecomp,
	title = {Greedy Friendship Decompositions of Graphs},
	journal = {Open Journal of Discrete Mathematics},
	volume = {1 (1)},
	number = {1},
	year = {2011},
	pages = {32{\textendash}34},
	abstract = {<p>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. </p>
},
	url = {http://www.scirp.org/journal/PaperInformation.aspx?paperID=4582},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2011-04-greedy_friendship.pdf},
	author = {Sousa, Teresa}
}
