{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:56:21Z","timestamp":1775062581491,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T00:00:00Z","timestamp":1379980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9660-6","type":"journal-article","created":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T12:18:23Z","timestamp":1379938703000},"page":"675-688","source":"Crossref","is-referenced-by-count":53,"title":["Neighbor sum distinguishing total colorings of planar graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Hualong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laihao","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingqiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,24]]},"reference":[{"key":"9660_CR1","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. North-Holland, New York"},{"issue":"17","key":"9660_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":"9660_CR3","unstructured":"Ding L, Wang G, Yan G Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz (submitted)"},{"key":"9660_CR4","unstructured":"Ding L, Wang, G Neighbor sum distinguishing total colorings via the combinatorial Nullstellensatz revisited (submitted)"},{"key":"9660_CR5","doi-asserted-by":"crossref","unstructured":"Dong A, Wang G Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree. Acta Math Sin (to appear)","DOI":"10.1007\/s10114-014-2454-7"},{"issue":"2","key":"9660_CR6","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. Sci Sin Math 42(2):151\u2013164 (in Chinese)","journal-title":"Sci Sin Math"},{"key":"9660_CR7","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:2548\u20132550","journal-title":"Discret Math"},{"issue":"14","key":"9660_CR8","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"},{"key":"9660_CR9","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\u20132\u20133-conjecture. J Comb Theory Ser B 100:347\u2013349","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"9660_CR10","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"},{"key":"9660_CR11","doi-asserted-by":"crossref","unstructured":"Li H, Liu B, Wang G (2013) Neighor sum distinguishing total colorings of $$K_4$$ K 4 -minor free graphs. Front Math China. doi: 10.1007\/s11464-013-0322-x","DOI":"10.1007\/s11464-013-0322-x"},{"key":"9660_CR12","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2011) On the adjacent-vertex-distinguishing index by sums in total proper colorings, Preprint MD 051. http:\/\/www.ii.uj.edu.pl\/preMD\/index.php"},{"issue":"1","key":"9660_CR13","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":"9660_CR14","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"},{"key":"9660_CR15","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 Combin 18:P112","journal-title":"Electron J Combin"},{"issue":"1","key":"9660_CR16","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 Theor Comput Sci 12(1):101\u2013108","journal-title":"Discret Math Theor Comput Sci"},{"key":"9660_CR17","unstructured":"Seamone B The 1\u20132\u20133 conjecture and related problems: a survey. arXiv:1211.5122"},{"key":"9660_CR18","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"},{"key":"9660_CR19","doi-asserted-by":"crossref","unstructured":"Wang W, Huang D (2012) The adjacent vertex distinguishing total coloring of planar graphs. J Comb Optim. doi: 10.1007\/s10878-012-9527-2","DOI":"10.1007\/s10878-012-9527-2"},{"issue":"12","key":"9660_CR20","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":"9660_CR21","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"},{"issue":"3","key":"9660_CR22","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"},{"key":"9660_CR23","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":"9660_CR24","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9660-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9660-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9660-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T16:34:21Z","timestamp":1596558861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9660-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,24]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9660"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9660-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,24]]}}}