{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:50:14Z","timestamp":1648972214184},"reference-count":3,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00190-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"235-237","source":"Crossref","is-referenced-by-count":0,"title":["Counting irregular multigraphs"],"prefix":"10.1016","volume":"195","author":[{"given":"Aron C.","family":"Atkins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabor N.","family":"Sarkozy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley M.","family":"Selkow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00190-3_BIB1","first-page":"6","article-title":"A lower bound for the number of irregular multigraphs","volume":"vol XXXI","author":"Gagliardi","year":"1996","journal-title":"Graph Theory Notes of New York"},{"key":"10.1016\/S0012-365X(98)00190-3_BIB2","unstructured":"D. Gagliardi, F. Harary, M Lewinter, Which graphs are irregularizable? unpublished manuscript."},{"key":"10.1016\/S0012-365X(98)00190-3_BIB3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0195-6698(13)80042-X","article-title":"Asymptotic enumeration by degree sequence of graphs of high degree","volume":"11","author":"McKay","year":"1990","journal-title":"European J. Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001903?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001903?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:24:07Z","timestamp":1556666647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":3,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98001903"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00190-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}