{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:10Z","timestamp":1740122410213,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11201180"],"award-info":[{"award-number":["11201180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Natural Science Foundation of Shandong Provence","award":["ZR2012AQ023"],"award-info":[{"award-number":["ZR2012AQ023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-015-9886-6","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T05:45:39Z","timestamp":1430718339000},"page":"626-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles"],"prefix":"10.1007","volume":"32","author":[{"given":"Jihui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Qiaoling","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xue","family":"Han","sequence":"additional","affiliation":[]},{"given":"Xiuyun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"key":"9886_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. Comb Probab. Comput 8:7\u201329","journal-title":"Combinatorial Nullstellensatz. Comb Probab. Comput"},{"key":"9886_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. North-Holland, New York"},{"issue":"17","key":"9886_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 (2008) On the adjacent vertex distinguishing total coloring numbers of graphs with $$\\Delta = 3$$ \u0394 = 3 . Discrete Math 308(17):4003\u20134007","journal-title":"Discrete Math"},{"issue":"9","key":"9886_CR4","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1007\/s11425-014-4796-0","volume":"57","author":"L Ding","year":"2013","unstructured":"Ding L, Wang G, Yan G (2013) Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz. Sci China Math 57(9):1875\u20131882","journal-title":"Sci China Math"},{"key":"9886_CR5","doi-asserted-by":"crossref","unstructured":"Ding L, Wang G, Wu J, Yu J (2014) Neighbor sum (set) distinguishing total choosability via the Combinatorial Nullstellensatz, submitted","DOI":"10.1007\/s11425-014-4796-0"},{"issue":"4","key":"9886_CR6","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"},{"issue":"2","key":"9886_CR7","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":"9886_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. Discrete Math 312(14):2162\u20132169","journal-title":"Discrete Math"},{"key":"9886_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-2-3-conjecture. J Comb Theory 100:347\u2013349","journal-title":"J Comb Theory"},{"issue":"6","key":"9886_CR10","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":"9886_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9660-6","author":"H Li","year":"2013","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","journal-title":"J Comb Optim"},{"key":"9886_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-013-1399-4","author":"M Pil\u015bniak","year":"2013","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2013) On the total-neighbor-distinguishing index by sums. Graph Comb. doi: 10.1007\/s00373-013-1399-4","journal-title":"Graph Comb"},{"key":"9886_CR13","first-page":"1","volume":"15","author":"J Przyby\u0142o","year":"2008","unstructured":"Przyby\u0142o J (2008) Irregularity strength of regular graphs. Electron J Comb 15:1","journal-title":"Electron J Comb"},{"key":"9886_CR14","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":"9886_CR15","unstructured":"Seamone B (2012) The 1\u20132-3 conjecture and related problems: a survey. arXiv:1211.5122"},{"issue":"12","key":"9886_CR16","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 39(12):1462\u20131472","journal-title":"Sci China"},{"key":"9886_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9527-2","author":"W Wang","year":"2012","unstructured":"Wang W, Huang D (2012) The adjacent vertex distinguishing total coloring of planar graphs. J Comb Opt. doi: 10.1007\/s10878-012-9527-2","journal-title":"J Comb Opt"},{"key":"9886_CR18","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2014.05.013","volume":"175","author":"GH Wang","year":"2014","unstructured":"Wang GH, Yan GY (2014) An improved upper bound for the neighbor sum distinguishing index of graphs. Discrete Appl Math 175:126\u2013128","journal-title":"Discrete Appl Math"},{"key":"9886_CR19","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.disc.2014.06.027","volume":"334","author":"GH Wang","year":"2014","unstructured":"Wang GH, Chen ZM, Wang JH (2014) Neighbor sum distinguishing index of planar graphs. Discrete Math 334:70\u201373","journal-title":"Discrete Math"},{"issue":"2","key":"9886_CR20","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s10114-015-4114-y","volume":"31","author":"J Wang","year":"2015","unstructured":"Wang J, Ma Q, Han X (2015) Neighbor sum distinguishing total colorings of triangle free planar graphs. Acta Math Sin 31(2):216\u2013224","journal-title":"Acta Math Sin"},{"key":"9886_CR21","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":"9886_CR22","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\u2013359","journal-title":"J Graph Theory"},{"issue":"3","key":"9886_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 48(3):289\u2013299","journal-title":"Sci China"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9886-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9886-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9886-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T19:19:57Z","timestamp":1598987997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9886-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9886"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9886-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2015,5,5]]}}}