{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:00:43Z","timestamp":1780434043863,"version":"3.54.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":12062,"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":[[1980,9]]},"DOI":"10.1016\/s0195-6698(80)80007-2","type":"journal-article","created":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T12:32:58Z","timestamp":1378729978000},"page":"235-241","source":"Crossref","is-referenced-by-count":3,"title":["The Automorphism Group of the Wreath Product of Directed Graphs"],"prefix":"10.1016","volume":"1","author":[{"given":"Ge\u0148a","family":"Hahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(80)80007-2_bib1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.2307\/2689054","article-title":"The group of the composition of two tournaments","volume":"41","author":"Alspach","year":"1968","journal-title":"Math Magazine"},{"key":"10.1016\/S0195-6698(80)80007-2_bib2","doi-asserted-by":"crossref","unstructured":"G. Hahn,The automorphism group of a product of hypergraphs, J. Combinatorial Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(81)90044-7"},{"key":"10.1016\/S0195-6698(80)80007-2_bib3","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1215\/S0012-7094-59-02667-5","article-title":"The composition of graphs","volume":"26","author":"Sabidussi","year":"1959","journal-title":"Duke Math J."},{"key":"10.1016\/S0195-6698(80)80007-2_bib4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1215\/S0012-7094-61-02857-5","article-title":"The lexicographic product of graphs","volume":"28","author":"Sabidussi","year":"1961","journal-title":"Duke Math J"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669880800072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669880800072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T08:22:42Z","timestamp":1539418962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669880800072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["S0195669880800072"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(80)80007-2","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}