{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T02:57:03Z","timestamp":1722481023425},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"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,5]]},"DOI":"10.1007\/s10878-015-9832-7","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T14:11:26Z","timestamp":1422886286000},"page":"1430-1442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic"],"prefix":"10.1007","volume":"31","author":[{"given":"Renyu","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"9832_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, New York"},{"issue":"17","key":"9832_CR2","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 (2008) On the adjacent vertex distinguishing total coloring numbers of graphs with $$\\Delta = 3$$ \u0394 = 3 . Discret Math 308(17):4003\u20134007","journal-title":"Discret Math"},{"key":"9832_CR3","unstructured":"Cheng X, Wu J, Huang D, Wang G Neighbor sum distinguishing total colorings of planar graphs with $$\\Delta $$ \u0394 . Discrete Applied Math (revised)"},{"issue":"9","key":"9832_CR4","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":"9832_CR5","unstructured":"Ding L, Wang G, Wu J, Yu J Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz revisited (submitted)"},{"issue":"4","key":"9832_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1142\/S1793830912500474","volume":"4","author":"A Dong","year":"2012","unstructured":"Dong A, Wang G (2012) Neighbor sum distinguishing colorings of some graphs. Discret Math Algorithm Appl 4(4):12","journal-title":"Discret Math Algorithm Appl"},{"key":"9832_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.dam.2013.10.009","volume":"166","author":"A Dong","year":"2014","unstructured":"Dong A, Wang G, Zhang JH (2014) Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree. Discret Appl Math 166:86\u201390","journal-title":"Discret Appl Math"},{"issue":"4","key":"9832_CR8","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 Sin 30(4):703\u2013709","journal-title":"Acta Math Sin"},{"key":"9832_CR9","doi-asserted-by":"crossref","unstructured":"Gao Y, Wang G, Wu J Neighbor sum distinguishing edge colorings of graphs with small maximum average degree. Bull Malaysia Math Sci Soc (to appear)","DOI":"10.1007\/s40840-015-0207-0"},{"issue":"2","key":"9832_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1360\/012011-359","volume":"42","author":"D Huang","year":"2012","unstructured":"Huang D, Wang W (2012) Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree, (in Chinese). Sci Sin Math 42(2):151\u2013164","journal-title":"Sci Sin Math"},{"issue":"14","key":"9832_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. Discret Math 312(14):2162\u20132169","journal-title":"Discret Math"},{"issue":"8","key":"9832_CR12","doi-asserted-by":"crossref","first-page":"2548","DOI":"10.1016\/j.disc.2008.06.002","volume":"309","author":"J Hulgan","year":"2009","unstructured":"Hulgan J (2009) Concise proofs for adjacent vertex-distinguishing total colorings. Discret Math 309(8):2548\u20132550","journal-title":"Discret Math"},{"issue":"3","key":"9832_CR13","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 Comb Theory Ser B 100(3):347\u2013349","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"9832_CR14","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 (2004) Edge weights and vertex colours. J Comb Theory Ser B 91(1):151\u2013157","journal-title":"J Comb Theory Ser B"},{"issue":"6","key":"9832_CR15","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":"9832_CR16","doi-asserted-by":"crossref","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"},{"key":"9832_CR17","doi-asserted-by":"crossref","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2013) On the total-neighbor-distinguishing index by sums. Graphs Comb. doi: 10.1007\/s00373-013-1399-4","DOI":"10.1007\/s00373-013-1399-4"},{"issue":"1","key":"9832_CR18","doi-asserted-by":"crossref","first-page":"R82","DOI":"10.37236\/806","volume":"15","author":"J Przyby\u0142o","year":"2008","unstructured":"Przyby\u0142o J (2008) Irregularity strength of regular graphs. Electron J Comb 15(1):R82","journal-title":"Electron J Comb"},{"issue":"1","key":"9832_CR19","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 Discret Math 23(1):511\u2013516","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"9832_CR20","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"Przyby\u0142o J, Wo\u017aniak M (2010) On a 1,2 conjecture. Discret Math Theory Comput Sci 12(1):101\u2013108","journal-title":"Discret Math Theory Comput Sci"},{"key":"9832_CR21","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. Electron J Comb 18:P112","journal-title":"Electron J Comb"},{"key":"9832_CR22","unstructured":"Seamone B (2012) The 1-2-3 conjecture and related problems: a survey. arXiv:1211.5122"},{"key":"9832_CR23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10878-006-9038-0","volume":"14","author":"H Wang","year":"2007","unstructured":"Wang H (2007) On the adjacent vertex distinguishing total chromatic number of the graphs with $$\\Delta (G)=3$$ \u0394 ( G ) = 3 . J Comb Optim 14:87\u2013109","journal-title":"J Comb Optim"},{"issue":"12","key":"9832_CR24","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 Math 39(12):1462\u20131472","journal-title":"Sci China Ser A Math"},{"key":"9832_CR25","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 (2010) Adjacent vertex distinguishing total colorings of outerplanar graphs. J Comb Optim 19:123\u2013133","journal-title":"J Comb Optim"},{"key":"9832_CR26","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.disc.2014.06.027","volume":"334","author":"G Wang","year":"2014","unstructured":"Wang G, Chen Z, Wang J (2014) Neighbor sum distinguishing index of planar graphs. Discret Math 334:70\u201373","journal-title":"Discret Math"},{"key":"9832_CR27","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2014.05.013","volume":"175","author":"G Wang","year":"2014","unstructured":"Wang G, Yan G (2014) An improved upper bound for the neighbor sum distinguishing index of graphs. Discret Appl Math 175:126\u2013128","journal-title":"Discret Appl Math"},{"key":"9832_CR28","doi-asserted-by":"crossref","unstructured":"Wang W, Huang D (2014) The adjacent vertex distinguishing total coloring of planar graphs. J Comb Optim 27(2):379\u2013396. doi: 10.1007\/s10878-012-9527-2","DOI":"10.1007\/s10878-012-9527-2"},{"key":"9832_CR29","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":"70","key":"9832_CR30","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1002\/jgt.20624","volume":"3","author":"T Wong","year":"2012","unstructured":"Wong T, Zhu X (2012) Antimagic labelling of vertex weighted graphs. J Graph Theory 3(70):348\u2013350","journal-title":"J Graph Theory"},{"issue":"3","key":"9832_CR31","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 Math 48(3):289\u2013299","journal-title":"Sci China Ser A Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9832-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9832-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9832-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T15:04:48Z","timestamp":1598713488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9832-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9832"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9832-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}