{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:35Z","timestamp":1753893815809,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats: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 is either a single edge or forms a graph isomorphic to $H$. The minimum number of parts in an $H$-decomposition of $G$ is denoted by $\\phi_H^r (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 case 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 $\\phi_H^r(n)$ will be obtained for bowtie, domino and kite decompositons of $r$-graphs.<\/jats:p>","DOI":"10.37236\/312","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:16:12Z","timestamp":1578716172000},"source":"Crossref","is-referenced-by-count":1,"title":["$H$-Decompositions of $r$-graphs when $H$ is an $r$-graph with exactly 2 edges"],"prefix":"10.37236","volume":"17","author":[{"given":"Teresa","family":"Sousa","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2010,3,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r40\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r40\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:58:34Z","timestamp":1579305514000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1r40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,8]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/312","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,3,8]]},"article-number":"R40"}}