{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:49:14Z","timestamp":1748015354926},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T00:00:00Z","timestamp":1521763200000},"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":[[2018,7]]},"DOI":"10.1007\/s10878-018-0271-0","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T13:39:44Z","timestamp":1521812384000},"page":"23-34","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Neighbor sum distinguishing total coloring of graphs with bounded treewidth"],"prefix":"10.1007","volume":"36","author":[{"given":"Miaomiao","family":"Han","sequence":"first","affiliation":[]},{"given":"You","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Zhengke","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"271_CR1","doi-asserted-by":"publisher","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":"Comb Probab Comput."},{"key":"271_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender HL (1998) A partial $$k$$ k -arboretum of graphs with bounded treewidth. Theor Comput Sci 209:1\u201345","journal-title":"Theor Comput Sci"},{"key":"271_CR3","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (2008) Graph theory. In: GTM, vol 244. Springer, Berlin","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"3","key":"271_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1002\/jgt.21874","volume":"81","author":"H Bruhn","year":"2016","unstructured":"Bruhn H, Lang R, Stein M (2016) List edge-coloring and total coloring in graphs of low treewidth. J Graph Theory 81(3):272\u2013282","journal-title":"J Graph Theory"},{"issue":"4","key":"271_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10114-014-2454-7","volume":"30","author":"AJ Dong","year":"2014","unstructured":"Dong AJ, Wang GH (2014) Neighbor sum distinguishing total coloring of graphs with bounded maximum average degree. Acta Math Sin 30(4):703\u2013709","journal-title":"Acta Math Sin"},{"issue":"9","key":"271_CR6","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1007\/s11425-014-4796-0","volume":"57","author":"LH Ding","year":"2014","unstructured":"Ding LH, Wang GH, Yang GY (2014) Neighbor sum distinguishing total coloring via the combinatorial Nullstellensatz. Sin China Ser Math 57(9):1875\u20131882","journal-title":"Sin China Ser Math"},{"key":"271_CR7","doi-asserted-by":"crossref","unstructured":"Kalkowski M (2009) A note on 1,2-conjecture, in Ph.D. Thesis","DOI":"10.5771\/9783845268019-1"},{"key":"271_CR8","doi-asserted-by":"publisher","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":"271_CR9","doi-asserted-by":"publisher","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":"271_CR10","unstructured":"Lang R (2015) On the list chromatic index of graphs of tree-width 3 and maximum degree 7. arXiv:1504.02122"},{"issue":"6","key":"271_CR11","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s11464-013-0322-x","volume":"8","author":"HL Li","year":"2013","unstructured":"Li HL, Liu BQ, Wang GH (2013) Neighbor sum distinguishing total coloring of $$K_4$$ K 4 -minor-free graphs. Front Math China 8(6):1351\u20131366","journal-title":"Front Math China"},{"issue":"3","key":"271_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10878-013-9660-6","volume":"30","author":"HL Li","year":"2015","unstructured":"Li HL, Ding LH, Liu BQ, Wang GH (2015) Neighbor sum distinguishing total colorings of planar graphs. J Comb Optim 30(3):675\u2013688","journal-title":"J Comb Optim"},{"key":"271_CR13","doi-asserted-by":"crossref","unstructured":"Lu Y, Han M, Luo R (2018) Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring. Discrete Appl Math 237:109\u2013115","DOI":"10.1016\/j.dam.2017.12.001"},{"key":"271_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ic.2016.08.001","volume":"251","author":"K Meeks","year":"2016","unstructured":"Meeks K, Scott A (2016) The parameterised complexity of list problems on graphs of bounded treewidth. Inf Comput 251:91\u2013103","journal-title":"Inf Comput"},{"key":"271_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00373-013-1399-4","volume":"31","author":"M Pil\u015bniak","year":"2015","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2015) On the total-neighbor distinguishing index by sums. Graphs Comb 31:771\u2013782","journal-title":"Graphs Comb"},{"issue":"1","key":"271_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. Discrete Math Theor Comput Sci 12(1):101\u2013108","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"4","key":"271_CR17","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s00373-015-1646-y","volume":"32","author":"JJ Yao","year":"2016","unstructured":"Yao JJ, Yu XW, Wang GH, Xu CQ (2016) Neighbor sum (set) distinguishing total choosability of $$d$$ d -degenerate graphs. Graphs Comb 32(4):1611\u20131620","journal-title":"Graphs Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0271-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T21:14:01Z","timestamp":1660684441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0271-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,23]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0271-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,23]]},"assertion":[{"value":"23 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}