@article {3109,
	title = {The H-Decomposition Problem for Graphs},
	journal = {Applied Mathematics},
	volume = {3},
	year = {2012},
	pages = {1719-1722},
	abstract = {<p>The concept of H-decompositions of graphs was first introduced by Erd{\"o}s, Goodman and P{\'o}sa in 1966, who were motivated by the problem of representing graphs by set intersections. Given graphs G and H, an 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 graph isomorphic to H. Let Ф(n,H) be the smallest number Ф, such that, any graph of order n admits an H-decomposition with at most Ф parts. The exact computation of Ф(n,H) for an arbitrary H is still an open problem. Recently, a few papers have been published about this problem. In this survey we will bring together all the results about H-decompositions. We will also introduce two new related problems, namely Weighted H-Decompositions of graphs and Monochromatic H-Decompositions of graphs.</p>
},
	url = {http://www.scirp.org/journal/am/},
	attachments = {https://docentes.fct.unl.pt/sites/default/files/tmjs/files/2012-h-decomp-problem.pdf},
	author = {Sousa, Teresa}
}
