{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:36:17Z","timestamp":1649018177210},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0195-6698(03)00025-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"229-237","source":"Crossref","is-referenced-by-count":0,"title":["Diagonal-complete latin squares"],"prefix":"10.1016","volume":"24","author":[{"given":"Olaf","family":"Krafft","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Pahlings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(03)00025-8_B1","series-title":"Latin Squares and their Applications","author":"D\u00e9nes","year":"1974"},{"key":"10.1016\/S0195-6698(03)00025-8_B2","doi-asserted-by":"crossref","unstructured":"J. D\u00e9nes, A.D. Keedwell, Latin Squares, Annals of Discrete Mathematics, vol. 46, North-Holland, Amsterdam, 1991","DOI":"10.1016\/S0167-5060(08)70969-5"},{"key":"10.1016\/S0195-6698(03)00025-8_B3","unstructured":"The GAP Group, GAP\u2014Groups, Algorithms and Programming, Version 4.3, 2002. Available from http:\/\/www.gap-system.org. The special functions used in this paper can be found in http:\/\/www.gap-system.org\/Info4\/deposit.html#pkg\/latinsquares"},{"key":"10.1016\/S0195-6698(03)00025-8_B4","doi-asserted-by":"crossref","first-page":"372","DOI":"10.2307\/2695253","article-title":"Problem 10871","volume":"108","author":"Knuth","year":"2001","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0195-6698(03)00025-8_B5","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1214\/aoms\/1177731539","article-title":"The construction of orthogonal latin squares","volume":"13","author":"Mann","year":"1943","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0195-6698(03)00025-8_B6","series-title":"Theory of Graphs","first-page":"237","article-title":"Hamiltonian decomposition of the complete directed n-graph","author":"Mendelsohn","year":"1966"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000258?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000258?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T09:31:08Z","timestamp":1584523868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669803000258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0195669803000258"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(03)00025-8","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}