{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:26:18Z","timestamp":1762251978577},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T00:00:00Z","timestamp":1371513600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s00373-013-1331-y","type":"journal-article","created":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T06:58:43Z","timestamp":1371452323000},"page":"1087-1098","source":"Crossref","is-referenced-by-count":15,"title":["Additive Coloring of Planar Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Tomasz","family":"Bartnicki","sequence":"first","affiliation":[]},{"given":"Bart\u0142omiej","family":"Bosek","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Czerwi\u0144ski","sequence":"additional","affiliation":[]},{"given":"Jaros\u0142aw","family":"Grytczuk","sequence":"additional","affiliation":[]},{"given":"Grzegorz","family":"Matecki","sequence":"additional","affiliation":[]},{"given":"Wiktor","family":"\u017belazny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,18]]},"reference":[{"key":"1331_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. Probab. Comput. 8, 7\u201329 (1999)","journal-title":"Combin. Probab. Comput."},{"key":"1331_CR2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1002\/jgt.20354","volume":"60","author":"T. Bartnicki","year":"2009","unstructured":"Bartnicki T., Grytczuk J., Niwczyk S.: Weight choosability of graphs. J. Graph Theory 60, 242\u2013256 (2009)","journal-title":"J. Graph Theory"},{"key":"1331_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/jgt.20392","volume":"62","author":"Y. Bu","year":"2009","unstructured":"Bu Y., Cranston D.W., Montassier M., Raspaud A., Wang W.: Star coloring of sparse graphs. J. Graph Theory. 62, 201\u2013219 (2009)","journal-title":"J. Graph Theory."},{"key":"1331_CR4","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00373-010-0952-7","volume":"26","author":"G. Chartrand","year":"2010","unstructured":"Chartrand G., Okamoto F., Zhang P.: The sigma chromatic number of a graph. Graphs Comb. 26, 755\u2013773 (2010)","journal-title":"Graphs Comb."},{"key":"1331_CR5","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.ipl.2009.05.011","volume":"109","author":"S. Czerwi\u0144ski","year":"2009","unstructured":"Czerwi\u0144ski S., Grytczuk J., \u00a0Zelazny W.: Lucky labelings of graphs. Inform. Process. Lett. 109, 1078\u20131081 (2009)","journal-title":"Inform. Process. Lett."},{"key":"1331_CR6","unstructured":"Hartsfield, N., Ringel, G.: Pearls of Graph Theory, Academic Press, London (1990)"},{"key":"1331_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","volume":"100","author":"M. Kalkowski","year":"2010","unstructured":"Kalkowski M., Karo\u0144ski M., Pfender F.: Vertex-coloring edge-weightings: towards 1\u20132\u20133-conjecture. J. Comb. Theory Ser. B 100, 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1331_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M. Karo\u0144ski","year":"2004","unstructured":"Karo\u0144ski M., \u0141uczak T., Thomason A.: Edge veights and vertex colours. J. Comb. Theory Ser. B 91, 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1331_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00493-009-2264-1","volume":"29","author":"H.A. Kierstead","year":"2009","unstructured":"Kierstead H.A., Konjevod G.: Coloring number and on-line Ramsey theory for graphs and hypergraphs. Combinatorica 29, 49\u201364 (2009)","journal-title":"Combinatorica"},{"key":"1331_CR10","doi-asserted-by":"crossref","first-page":"821","DOI":"10.4169\/amermathmont.117.9.0821","volume":"117","author":"M. Micha\u0142ek","year":"2010","unstructured":"Micha\u0142ek M.: A short proof of Combinatorial Nullstellensatz. Am. Math. Mon. 117, 821\u2013823 (2010)","journal-title":"Am. Math. Mon."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1331-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1331-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1331-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T19:13:59Z","timestamp":1551208439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1331-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,18]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["1331"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1331-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,18]]}}}