{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:41:50Z","timestamp":1757576510113},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,5,1]],"date-time":"1974-05-01T00:00:00Z","timestamp":136598400000},"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":14322,"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,5]]},"DOI":"10.1016\/0012-365x(74)90135-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"227-244","source":"Crossref","is-referenced-by-count":17,"title":["An algorithm for the construction of the graphs of organic molecules"],"prefix":"10.1016","volume":"8","author":[{"given":"Harold","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Masinter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(74)90135-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(74)80015-4","article-title":"Constructive graph labeling using double cosets","volume":"7","author":"Brown","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(74)90135-6_BIB2","first-page":"209","article-title":"A program for generating explanatory hypotheses in organic chemistry","volume":"4","author":"Buchanan","year":"1969"},{"key":"10.1016\/0012-365X(74)90135-6_BIB3","first-page":"165","article-title":"On generality and problem solving: A case study using the DENDRAL program","volume":"6","author":"Feigenbaum","year":"1971"},{"key":"10.1016\/0012-365X(74)90135-6_BIB4","first-page":"496","article-title":"On realizability of a set of imegers as degree of the vertices of a linear graph","volume":"10","author":"Hakimi","year":"1962","journal-title":"I.J. SIAM"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74901356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74901356?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:05Z","timestamp":1555152785000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X74901356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,5]]}},"alternative-id":["0012365X74901356"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(74)90135-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1974,5]]}}}