{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:15:50Z","timestamp":1648588550314},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,9,1]],"date-time":"1974-09-01T00:00:00Z","timestamp":147225600000},"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":14199,"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":[[1974,9]]},"DOI":"10.1016\/0012-365x(74)90011-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"289-292","source":"Crossref","is-referenced-by-count":1,"title":["Two problems in the enumeration of unlabelled graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"E.M.","family":"Wright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(74)90011-9_bib1","series-title":"Enumeration of linear graphs and connected linear graphs up to P=18 points","author":"Stem","year":"1963"},{"key":"10.1016\/0012-365X(74)90011-9_bib2","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1090\/S0002-9904-1972-13097-0","article-title":"The number of unlabelled graphs with many nodes and edges","volume":"78","author":"Wright","year":"1972","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0012-365X(74)90011-9_bib3","doi-asserted-by":"crossref","unstructured":"F.M. Wright, Graphs on unlabelled nodes with a large number of edges, Proc. London Math. Soc., to appear.","DOI":"10.1112\/plms\/s3-28.4.577"},{"key":"10.1016\/0012-365X(74)90011-9_bib4","unstructured":"F.M. Wright, The probability of connectedness of a large unlabelled graph, Bull. Am. Math. Soc., to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74900119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74900119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:53:20Z","timestamp":1555152800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X74900119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,9]]}},"alternative-id":["0012365X74900119"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(74)90011-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1974,9]]}}}