{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:44Z","timestamp":1753893824863,"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>A $k$-cycle decomposition of a multipartite graph $G$ is said to be gregarious if each $k$-cycle in the decomposition intersects $k$ distinct partite sets of $G$. In this paper we prove necessary and sufficient conditions for the existence of such a decomposition in the case where $G$ is the complete equipartite graph, having $n$ parts of size $m$, and either $n\\equiv 0,1\\pmod{k}$, or $k$ is odd and $m\\equiv 0\\pmod{k}$. As a consequence, we prove necessary and sufficient conditions for decomposing complete equipartite graphs into gregarious cycles of prime length.<\/jats:p>","DOI":"10.37236\/224","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:24:03Z","timestamp":1578698643000},"source":"Crossref","is-referenced-by-count":4,"title":["Some Gregarious Cycle Decompositions of Complete Equipartite Graphs"],"prefix":"10.37236","volume":"16","author":[{"given":"Benjamin R.","family":"Smith","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2009,11,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r135\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r135\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:39:49Z","timestamp":1579297189000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,13]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/224","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2009,11,13]]},"article-number":"R135"}}