{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:48:52Z","timestamp":1648640932306},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"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":[[1994,4]]},"DOI":"10.1016\/0012-365x(94)90109-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"151-163","source":"Crossref","is-referenced-by-count":0,"title":["Minimum degree games for graphs"],"prefix":"10.1016","volume":"128","author":[{"given":"Daniel M.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Harary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90109-0_BIB1","first-page":"29","article-title":"Diameter avoidance games for graphs","volume":"7","author":"Buckley","year":"1984","journal-title":"Bull Malaysian Math. Soc."},{"key":"10.1016\/0012-365X(94)90109-0_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(94)90109-0_BIB3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.2307\/2690415","article-title":"On degree achievement and avoidance games for graphs","volume":"60","author":"Harary","year":"1987","journal-title":"Math. Mag."},{"key":"10.1016\/0012-365X(94)90109-0_BIB4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.2307\/2686552","article-title":"Connect-it games","volume":"15","author":"Harary","year":"1984","journal-title":"College Math. J."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:25Z","timestamp":1555135105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0012365X94901090"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90109-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}