{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:44:21Z","timestamp":1763534661706},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"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":[[1997,12]]},"DOI":"10.1016\/s0012-365x(97)00017-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"279-285","source":"Crossref","is-referenced-by-count":8,"title":["Hamiltonian decomposition of complete regular multipartite digraphs"],"prefix":"10.1016","volume":"177","author":[{"given":"Lenhard L","family":"Ng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00017-4_BIB1","series-title":"Cycles and Rays","first-page":"9","article-title":"Decompositions into cycles I: Hamilton decompositions","author":"Alspach","year":"1990"},{"key":"10.1016\/S0012-365X(97)00017-4_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(76)90039-X","article-title":"On decompositions of r-partite graphs into edge-disjoint hamiltonian circuits","volume":"14","author":"Auerbach","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00017-4_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0095-8956(81)90028-9","article-title":"Hamiltonian decomposition of lexicographic product","volume":"31","author":"Baranyai","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(97)00017-4_BIB4","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 Ser. B"},{"key":"10.1016\/S0012-365X(97)00017-4_BIB5","first-page":"5","article-title":"On the 1-factors and the Hamiltonian circuits of complete n-colorable graphs","volume":"19","author":"Hetyei","year":"1975","journal-title":"Acta Acad. Paedagog. Civitate Pecs Ser. 6 Math. Phys. Chem. Tech."},{"key":"10.1016\/S0012-365X(97)00017-4_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(80)90044-1","article-title":"A hamiltonian decomposition of K2n, 2n \u2a7e 8","volume":"29","author":"Tillson","year":"1980","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:11Z","timestamp":1556131811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0012365X97000174"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00017-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}