{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:32:01Z","timestamp":1773081121726,"version":"3.50.1"},"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>In this paper we consider the problem of finding the smallest number $q$ such that any graph $G$ of order $n$ admits a decomposition into edge disjoint copies of a fixed graph $H$ and single edges with at most $q$ elements. We solve the case when $H$ is the 5-cycle, the 5-cycle with a chord and any connected non-bipartite non-complete graph of order 4.<\/jats:p>","DOI":"10.37236\/1946","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:09:29Z","timestamp":1578719369000},"source":"Crossref","is-referenced-by-count":10,"title":["Decompositions of Graphs into 5-Cycles and Other Small Graphs"],"prefix":"10.37236","volume":"12","author":[{"given":"Teresa","family":"Sousa","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2005,9,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1r49\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1r49\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:40:47Z","timestamp":1579322447000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v12i1r49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,29]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1946","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,29]]},"article-number":"R49"}}