{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:06Z","timestamp":1759638486844},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T00:00:00Z","timestamp":1433203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9911-9","type":"journal-article","created":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T09:13:56Z","timestamp":1433150036000},"page":"906-916","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Neighbor sum distinguishing total choosability of planar graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Cunquan","family":"Qu","sequence":"first","affiliation":[]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guiying","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Xiaowei","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,2]]},"reference":[{"key":"9911_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N (1999) Combinatorial Nullstellensatz. Combin Probab Comput 8:7\u201329","journal-title":"Combin Probab Comput"},{"key":"9911_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Elsevier, North-Holland"},{"key":"9911_CR3","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"OV Borodin","year":"1997","unstructured":"Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Combin Theory Ser B 71:184\u2013204","journal-title":"J Combin Theory Ser B"},{"key":"9911_CR4","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand G, Jacobson M, Lehel J, Oellermann O, Ruiz S, Saba F (1988) Irregular networks. Congr Numer 64:197\u2013210","journal-title":"Congr Numer"},{"key":"9911_CR5","doi-asserted-by":"publisher","unstructured":"Cheng X, Huang D, Wang G, Wu J (2015) Neighbor sum distinguishing total colorings of planar graphs with maximum degree $$\\Delta $$ \u0394 . Discrete Appl. Math. doi: 10.1016\/j.dam.2015.03.013","DOI":"10.1016\/j.dam.2015.03.013"},{"key":"9911_CR6","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.disc.2012.04.006","volume":"312","author":"T Coker","year":"2012","unstructured":"Coker T, Johannson K (2012) The adjacent vertex distinguishing total chromatic number. Discrete Math 312:741\u20132750","journal-title":"Discrete Math"},{"issue":"9","key":"9911_CR7","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 (2014) Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz. Sci China Math 57(9):1875\u20131882","journal-title":"Sci China Math"},{"key":"9911_CR8","unstructured":"Ding L, Wang G, Wu J, Yu J (submitted) Neighbor sum (set) distinguishing total choosability via the Combinatorial Nullstellensatz"},{"issue":"4","key":"9911_CR9","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 (2014) Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree. Acta Math Sinica 30(4):703\u2013709","journal-title":"Acta Math Sinica"},{"issue":"24","key":"9911_CR10","doi-asserted-by":"crossref","first-page":"3544","DOI":"10.1016\/j.disc.2012.08.006","volume":"312","author":"D Huang","year":"2012","unstructured":"Huang D, Wang W, Yan C (2012) A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math 312(24):3544\u20133546","journal-title":"Discrete Math"},{"issue":"14","key":"9911_CR11","doi-asserted-by":"crossref","first-page":"2162","DOI":"10.1016\/j.disc.2011.09.019","volume":"312","author":"P Huang","year":"2012","unstructured":"Huang P, Wong T, Zhu X (2012) Weighted-1-antimagic graphs of prime power order. Discrete Math 312(14):2162\u20132169","journal-title":"Discrete Math"},{"key":"9911_CR12","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 (2010) Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J Combin Theory Ser B 100:347\u2013349","journal-title":"J Combin Theory Ser B"},{"key":"9911_CR13","doi-asserted-by":"publisher","unstructured":"Li H, Ding L, Liu B, Wang G (2013) Neighbor sum distinguishing total colorings of planar graphs. J Comb Optim. doi: 10.1007\/s10878-013-9660-6","DOI":"10.1007\/s10878-013-9660-6"},{"issue":"6","key":"9911_CR14","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 (2013) Neighor sum distinguishing total colorings of $$K_{4}$$ K 4 -minor free graphs. Front Math China 8(6):1351\u20131366","journal-title":"Front Math China"},{"key":"9911_CR15","doi-asserted-by":"publisher","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2013) On the total-neighbor-distinguishing index by sums. Graphs Combin. doi: 10.1007\/s00373-013-1399-4","DOI":"10.1007\/s00373-013-1399-4"},{"issue":"1","key":"9911_CR16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/070707385","volume":"23","author":"J Przyby\u0142o","year":"2009","unstructured":"Przyby\u0142o J (2009) Linear bound on the irregularity strength and the total vertex irregularity strength of graphs. SIAM J Discrete Math 23(1):511\u2013516","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"9911_CR17","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"Przyby\u0142o J, Wo\u017aniak M (2010) On a 1,2 conjecture. Discrete Math Theor Comput Sci 12(1):101\u2013108","journal-title":"Discrete Math Theor Comput Sci"},{"key":"9911_CR18","doi-asserted-by":"crossref","first-page":"P112","DOI":"10.37236\/599","volume":"18","author":"J Przyby\u0142o","year":"2011","unstructured":"Przyby\u0142o J, Wo\u017aniak M (2011) Total weight choosability of graphs. Electronic J Combin 18:P112","journal-title":"Electronic J Combin"},{"key":"9911_CR19","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0012-365X(74)90157-5","volume":"8","author":"E Scheim","year":"1974","unstructured":"Scheim E (1974) The number of edge 3-colorings of a planar cubic graph as a permanent. Discrete Math 8:377\u2013382","journal-title":"Discrete Math"},{"issue":"2","key":"9911_CR20","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 (2014) The adjacent vertex distinguishing total coloring of planar graphs. J Combin Optim 27(2):379\u2013396","journal-title":"J Combin Optim"},{"issue":"12","key":"9911_CR21","first-page":"1462","volume":"39","author":"W Wang","year":"2009","unstructured":"Wang W, Wang P (2009) On adjacent-vertex- distinguishing total coloring of $$K_4$$ K 4 -minor free graphs. Sci China Ser A 39(12):1462\u20131472","journal-title":"Sci China Ser A"},{"key":"9911_CR22","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1002\/jgt.20500","volume":"66","author":"T Wong","year":"2011","unstructured":"Wong T, Zhu X (2011) Total weight choosability of graphs. J Graph Theory 66:198\u2013212","journal-title":"J Graph Theory"},{"issue":"3","key":"9911_CR23","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 (2005) On adjacent-vertex- distinguishing total coloring of graphs. Sci China Ser A 48(3):289\u2013299","journal-title":"Sci China Ser A"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9911-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9911-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9911-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T22:33:04Z","timestamp":1599085984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9911-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,2]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9911"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9911-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,2]]}}}