{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:11:43Z","timestamp":1777540303552,"version":"3.51.4"},"reference-count":2,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,29]],"date-time":"2011-11-29T00:00:00Z","timestamp":1322524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00373-011-1112-4","type":"journal-article","created":{"date-parts":[[2011,11,28]],"date-time":"2011-11-28T03:42:04Z","timestamp":1322451724000},"page":"157-163","source":"Crossref","is-referenced-by-count":17,"title":["On the Lucky Choice Number of Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"S.","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ghanbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Manaviyat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Zare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,29]]},"reference":[{"key":"1112_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N. Alon","year":"1999","unstructured":"Alon N.: Combinatorial Nullstellensatz. Combin. Prob. Comput. 8, 7\u201329 (1999)","journal-title":"Combin. Prob. Comput."},{"key":"1112_CR2","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.ipl.2009.05.011","volume":"109","author":"S. Czerwinski","year":"2009","unstructured":"Czerwinski S., Grytczuk J., Zelazny W.: Lucky labelings of graphs. Inform. Process. Lett. 109, 1078\u20131081 (2009)","journal-title":"Inform. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1112-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1112-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1112-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:32Z","timestamp":1559041172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1112-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,29]]},"references-count":2,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1112"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1112-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,29]]}}}