{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:38:30Z","timestamp":1778740710638,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T00:00:00Z","timestamp":1446768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11301134"],"award-info":[{"award-number":["11301134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11301135"],"award-info":[{"award-number":["11301135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11471193"],"award-info":[{"award-number":["11471193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province (CN)","doi-asserted-by":"publisher","award":["A2015202301"],"award-info":[{"award-number":["A2015202301"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Science and Technology Project of Hebei Province","award":["ZD2015106"],"award-info":[{"award-number":["ZD2015106"]}]},{"name":"Scientific Research Foundation for the Excellent Middle-Age and Young Scientists of Shandong Province","award":["BS2012SF016"],"award-info":[{"award-number":["BS2012SF016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1646-y","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T10:07:08Z","timestamp":1446804428000},"page":"1611-1620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Jingjing","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changqing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"1646_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8, 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"1646_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"J Bondy","year":"2008","unstructured":"Bondy, J., Murty, U.: Graph theory. Springer, London (2008)"},{"issue":"17","key":"1646_CR3","doi-asserted-by":"crossref","first-page":"4003","DOI":"10.1016\/j.disc.2007.07.091","volume":"308","author":"X Chen","year":"2008","unstructured":"Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with $$\\varDelta =3$$ \u0394 = 3 . Discrete Math. 308(17), 4003\u20134007 (2008)","journal-title":"Discrete Math."},{"key":"1646_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.dam.2015.03.013","volume":"190","author":"X Cheng","year":"2015","unstructured":"Cheng, X., Wu, J., Huang, D., Wang, G.: Neighbor sum distinguishing total colorings of planar with maximum degree $$\\varDelta $$ \u0394 . Discret. Appl. Math. 190, 34\u201341 (2015)","journal-title":"Discret. Appl. Math."},{"key":"1646_CR5","doi-asserted-by":"crossref","unstructured":"Ding, L., Wang, G., Wu, J., Yu, J.: Neighbor sum (set) distinguishing total choosability via the Combinatorial Nullstellensatz. Sci. China. Math. 57(9), 1875\u20131882","DOI":"10.1007\/s11425-014-4796-0"},{"issue":"9","key":"1646_CR6","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1007\/s11425-014-4796-0","volume":"57","author":"L Ding","year":"2014","unstructured":"Ding, L., Wang, G., Yan, G.: Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz. Sci. China Math. 57(9), 1875\u20131882 (2014)","journal-title":"Sci. China Math."},{"issue":"4","key":"1646_CR7","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s10114-014-2454-7","volume":"30","author":"A Dong","year":"2014","unstructured":"Dong, A., Wang, G.: Neighbor sum distinguishing total coloring of graphs with bounded maximum average degree. Acta Math. Sin. 30(4), 703\u2013709 (2014)","journal-title":"Acta Math. Sin."},{"issue":"3","key":"1646_CR8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10878-013-9660-6","volume":"30","author":"H Li","year":"2015","unstructured":"Li, H., Ding, L., Liu, B., Wang, G.: Neighbor sum distinguishing total colorings of planar graphs. J. Comb. Optim. 30(3), 675\u2013685 (2015)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"1646_CR9","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1007\/s11464-013-0322-x","volume":"8","author":"H Li","year":"2013","unstructured":"Li, H., Liu, B., Wang, G.: Neighbor sum distinguishing total colorings of $$K_{4}$$ K 4 -minor free graphs. Front. Math. China 8(6), 1351\u20131366 (2013)","journal-title":"Front. Math. China"},{"issue":"3","key":"1646_CR10","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/120880586","volume":"27","author":"J Przyby\u0142o","year":"2013","unstructured":"Przyby\u0142o, J.: Neighbor distinguishing edge colorings via Combinatorial Nullstellensatz. SIAM J. Discrete Math. 27(3), 1313\u20131322 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1646_CR11","doi-asserted-by":"publisher","unstructured":"Pil\u015bniak, M., Wo\u017aniak, M.: On the adjacent vertex distinguishing index by sums in total proper colorings. Graphs Comb. (2013). doi: 10.1007\/s00373-013-1399-4","DOI":"10.1007\/s00373-013-1399-4"},{"key":"1646_CR12","unstructured":"Wang, G., Ding, L., Cheng X., Wu, J.: Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Submitted"},{"issue":"2","key":"1646_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10878-012-9527-2","volume":"27","author":"W Wang","year":"2014","unstructured":"Wang, W., Huang, D.: The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim. 27(2), 379\u2013396 (2014)","journal-title":"J. Comb. Optim."},{"issue":"12","key":"1646_CR14","first-page":"1462","volume":"39","author":"W Wang","year":"2009","unstructured":"Wang, W., Wang, P.: On adjacent-vertex-distinguishing total coloring of $$K_{4}$$ K 4 -minor free graphs. Sci. China Ser. A 39(12), 1462\u20131472 (2009)","journal-title":"Sci. China Ser. A"},{"key":"1646_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10878-008-9165-x","volume":"19","author":"Y Wang","year":"2010","unstructured":"Wang, Y., Wang, W.: Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19, 123\u2013133 (2010)","journal-title":"J. Comb. Optim."},{"key":"1646_CR16","unstructured":"Yao, J., Yu, X., Wang, G., Xu, C.: Neighbor sum distinguishing total coloring of 2-degenerate graph, Submitted"},{"issue":"3","key":"1646_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1360\/03YS0207","volume":"48","author":"Z Zhang","year":"2005","unstructured":"Zhang, Z., Chen, X., Li, J., Yao, B., Lu, X., Wang, J.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A 48(3), 289\u2013299 (2005)","journal-title":"Sci. China Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1646-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1646-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1646-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T05:33:52Z","timestamp":1567316032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1646-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,6]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1646"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1646-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,6]]}}}