{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:45:56Z","timestamp":1744263956201},"reference-count":3,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11520,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1016\/0012-365x(82)90283-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"143-156","source":"Crossref","is-referenced-by-count":1,"title":["Cycle decompositions of complete graphs"],"prefix":"10.1016","volume":"38","author":[{"given":"E.J.","family":"Farrell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"B","key":"10.1016\/0012-365X(82)90283-7_BIB1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(76)90055-1","article-title":"Decomposition of the complete directed graph into k-circuits","volume":"21","author":"Bermond","year":"1976","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(82)90283-7_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(79)90014-1","article-title":"On a class of polynomials obtained from the circuit in a graph and its application to characteristics polynomials of graphs","volume":"25","author":"Farrell","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(82)90283-7_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(75)90105-3","article-title":"Partition of the edges of the directed complete graph into 4-cycles","volume":"11","author":"Sch\u00f6nheim","year":"1975","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902837?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902837?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T12:21:55Z","timestamp":1554898915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82902837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":3,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1982]]}},"alternative-id":["0012365X82902837"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90283-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}