@article {sousa:fsdecomp,
	title = {Friendship decompositions of graphs},
	journal = {Discrete Mathemathics},
	volume = {308},
	number = {15},
	year = {2008},
	pages = {3352{\textendash}3360},
	abstract = {<p>Let G be a simple graph. A clique is a subgraph of G isomorphic to a complete graph, and a t-friendship graph is a graph consisting of t edge-disjoint cliques sharing one vertex. A t-friendship decomposition of G for a fixed value of t is a set F of edge-disjoint t-friendship subgraphs of G such that every edge of G belongs to exactly one element of F. It is proved that any graph of order n admits a t-friendship decomposition with at most n2/4t+n/4t+n elements for all fixed t>=2. For t=2,3 exact bounds are given. For t=2 the bound is ⌈n2/8⌉ for n even and (n2-1)/8 for n odd; for t=3 the bound is ⌈n2/12⌉ for n even and ⌈(n2-1)/12⌉ for n odd. </p>
},
	issn = {0012-365X},
	doi = {10.1016/j.disc.2007.06.042},
	url = {http://www.sciencedirect.com/science/article/pii/S0012365X07004876},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/tmjs/files/friendship-decomposition.pdf},
	author = {Sousa, Teresa}
}
