@article {sousa: 2-edge-decomposition,
	title = {H-decompositions of r-graphs when H is an r-graph with exactly 2 edges},
	journal = {Electronic Journal of Combinatorics},
	volume = {17},
	number = {1},
	year = {2010},
	pages = {Research Paper 40, 8},
	abstract = {<p>"Given two r-graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part either is a single edge or forms a graph isomorphic to H. The minimum number of parts in an H-decomposition of G is denoted by φrH(G). By a 2-edge-decomposition of an r-graph we mean an H-decomposition for any fixed r-graph H with exactly 2 edges. In the special cases where the two edges of H intersect in exactly 1, 2 or r-1 vertices, these 2-edge-decompositions will be called bowtie, domino and kite, respectively. The value of the function φrH(n) will be obtained for bowtie, domino and kite decompositions of r-graphs.{\textquoteright}{\textquoteright} </p>
},
	issn = {1077-8926},
	url = {http://www.combinatorics.org/Volume_17/Abstracts/v17i1r40.html},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2010-03-hypergraphs.pdf},
	author = {Sousa, Teresa}
}
