{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:57:30Z","timestamp":1648529850601},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13346,"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":[[1977]]},"DOI":"10.1016\/0012-365x(77)90100-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"201-212","source":"Crossref","is-referenced-by-count":0,"title":["Minimal graphs with cyclic color group"],"prefix":"10.1016","volume":"19","author":[{"given":"A.","family":"Czerniakiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(77)90100-5_BIB1","first-page":"239","article-title":"Herstellung von Graphen hat vorgegebener abstrakten Gruppr","volume":"6","author":"Frucht","year":"1938","journal-title":"Compositio Math."},{"key":"10.1016\/0012-365X(77)90100-5_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1111\/j.1749-6632.1970.tb56466.x","article-title":"How to describe a graph","volume":"175","author":"Frucht","year":"1970","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0012-365X(77)90100-5_BIB3","series-title":"Combinatorial Structure and Their Applications","first-page":"103","article-title":"Extremum problems concerning graphs and their groups","author":"Gewirtz","year":"1970"},{"key":"10.1016\/0012-365X(77)90100-5_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(77)90100-5_BIB5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.21136\/CMJ.1966.100711","article-title":"The smallest graph whose group is cyclic","volume":"16","author":"Harary","year":"1966","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(77)90100-5_BIB6_1","unstructured":"R.L. Meriwether, 1963, unpublished"},{"key":"10.1016\/0012-365X(77)90100-5_BIB6_2","volume":"33","author":"Sabidussi","year":"1967","journal-title":"Math. Rev."},{"key":"10.1016\/0012-365X(77)90100-5_BIB7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/BF01299094","article-title":"On the minimum order of graphs with a given automorphism group","volume":"63","author":"Sabidussi","year":"1959","journal-title":"Monatsh. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901005?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77901005?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T21:14:15Z","timestamp":1621026855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X77901005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977]]}},"alternative-id":["0012365X77901005"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(77)90100-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}