{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T04:18:28Z","timestamp":1743481108359},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0012-365x(93)90345-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"287-291","source":"Crossref","is-referenced-by-count":6,"title":["Partition of a bipartite graph into cycles"],"prefix":"10.1016","volume":"117","author":[{"given":"Hong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90345-T_BIB1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(84)90050-5","article-title":"On circuits in graphs","volume":"50","author":"El-Zahar","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90345-T_BIB2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","article-title":"A method in graph theory","volume":"15","author":"Bondy","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90345-T_BIB3","first-page":"89","article-title":"On 2-factors with two components","volume":"20","author":"Hellgren","year":"1985","journal-title":"Ars. Combin."},{"key":"10.1016\/0012-365X(93)90345-T_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placement of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390345T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390345T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:20Z","timestamp":1555134860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390345T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0012365X9390345T"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90345-t","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}