{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:07:29Z","timestamp":1648782449470},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"vor","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":[[2020,2]]},"DOI":"10.1007\/s10878-019-00480-4","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T14:03:09Z","timestamp":1574258589000},"page":"412-424","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the total neighbour sum distinguishing index of graphs with bounded maximum average degree"],"prefix":"10.1007","volume":"39","author":[{"given":"H.","family":"Hocquard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Przyby\u0142o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,20]]},"reference":[{"key":"480_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner M, Triesch E (1990) Irregular assignments of trees and forests. SIAM J Discrete Math 3:439\u2013449","journal-title":"SIAM J Discrete Math"},{"key":"480_CR2","doi-asserted-by":"publisher","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":"480_CR3","unstructured":"Behzad M (1965) Graphs and their chromatic numbers, Ph.D. Thesis, Michigan State University"},{"issue":"3","key":"480_CR4","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/jgt.22098","volume":"85","author":"M Bonamy","year":"2017","unstructured":"Bonamy M, Przyby\u0142o J (2017) On the neighbor sum distinguishing index of planar graphs. J Graph Theory 85(3):669\u2013690","journal-title":"J Graph Theory"},{"key":"480_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-88-7642-475-5_50","volume-title":"The Seventh European Conference on Combinatorics, Graph Theory and Applications","author":"Marthe Bonamy","year":"2013","unstructured":"Bonamy M, Bousquet N, Hocquard H (2013) Adjacent vertex-distinguishing edge coloring of graphs. In: Proceedings of the seventh European conference on combinatorics, graph theory and applications, pp 313\u2013318"},{"issue":"1","key":"480_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1080\/07468342.1988.11973088","volume":"19","author":"G Chartrand","year":"1988","unstructured":"Chartrand G, Erd\u0151s P, Oellermann OR (1988a) How to define an irregular graph. Coll Math J 19(1):36\u201342","journal-title":"Coll Math J"},{"key":"480_CR7","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand G, Jacobson MS, Lehel J, Oellermann OR, Ruiz S, Saba F (1988b) Irregular networks. Congr Numer 64:197\u2013210","journal-title":"Irregular networks. Congr Numer"},{"key":"480_CR8","unstructured":"Cohen N (2010) Several graph problems and their linear program formulations. https:\/\/hal.inria.fr\/inria-00504914v2"},{"issue":"4","key":"480_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/jgt.20313","volume":"58","author":"B Cuckler","year":"2008","unstructured":"Cuckler B, Lazebnik F (2008) Irregularity strength of dense graphs. J Graph Theory 58(4):299\u2013313","journal-title":"J Graph Theory"},{"issue":"4","key":"480_CR10","doi-asserted-by":"publisher","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 Matematica Sinica 30(4):703\u2013709","journal-title":"Acta Matematica Sinica"},{"issue":"2","key":"480_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/jgt.10056","volume":"41","author":"A Frieze","year":"2002","unstructured":"Frieze A, Gould RJ, Karo\u0144ski M, Pfender F (2002) On graph irregularity strength. J Graph Theory 41(2):120\u2013137","journal-title":"J Graph Theory"},{"issue":"6","key":"480_CR12","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00373-017-1822-3","volume":"33","author":"H Hocquard","year":"2017","unstructured":"Hocquard H, Przyby\u0142o J (2017) On the neighbour sum distinguishing index of graphs with bounded maximum average degree. Graphs Combin 33(6):1459\u20131471","journal-title":"Graphs Combin"},{"key":"480_CR13","first-page":"45","volume":"5","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Choosability versus chromaticity. Geombinatorics 5:45\u201364","journal-title":"Geombinatorics"},{"issue":"3","key":"480_CR14","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski M, Karo\u0144ski M, Pfender F (2011) A new upper bound for the irregularity strength of graphs. SIAM J Discrete Math 25(3):1319\u20131321","journal-title":"SIAM J Discrete Math"},{"key":"480_CR15","first-page":"765","volume-title":"Facts and quests on degree irregular assignments, graph theory, combinatorics and applications","author":"J Lehel","year":"1991","unstructured":"Lehel J (1991) Facts and quests on degree irregular assignments, graph theory, combinatorics and applications. Willey, New York, pp 765\u2013782"},{"issue":"6","key":"480_CR16","doi-asserted-by":"publisher","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) Neighbor sum distinguishing total colorings of $$K_4$$-minor free graphs. Front Math China 8(6):1351\u20131366","journal-title":"Front Math China"},{"issue":"3","key":"480_CR17","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10878-013-9660-6","volume":"30","author":"H Li","year":"2015","unstructured":"Li H, Ding L, Liu B, Wang G (2015) Neighbor sum distinguishing total colorings of planar graphs. J Combin Optim 30(3):675\u2013688","journal-title":"J Combin Optim"},{"issue":"2","key":"480_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.disc.2016.08.012","volume":"340","author":"S Loeb","year":"2017","unstructured":"Loeb S, Przyby\u0142o J, Tang Y (2017) Asymptotically optimal neighbor sum distinguishing total colorings of graphs. Discrete Math 340(2):58\u201362","journal-title":"Discrete Math"},{"issue":"1","key":"480_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/120886650","volume":"28","author":"P Majerski","year":"2014","unstructured":"Majerski P, Przyby\u0142o J (2014) On the irregularity strength of dense graphs. SIAM J Discrete Math 28(1):197\u2013205","journal-title":"SIAM J Discrete Math"},{"key":"480_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/PL00009820","volume":"18","author":"M Molloy","year":"1998","unstructured":"Molloy M, Reed B (1998) A bound on the total chromatic number. Combinatorica 18:241\u2013280","journal-title":"Combinatorica"},{"key":"480_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T Nierhoff","year":"2000","unstructured":"Nierhoff T (2000) A tight bound on the irregularity strength of graphs. SIAM J Discrete Math 13:313\u2013323","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"480_CR22","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 Combin 31(3):771\u2013782","journal-title":"Graphs Combin"},{"key":"480_CR23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejc.2018.10.009","volume":"77","author":"J Przyby\u0142o","year":"2019","unstructured":"Przyby\u0142o J (2019) A note on asymptotically optimal neighbour sum distinguishing colourings. Eur J Combin 77:49\u201356","journal-title":"Eur J Combin"},{"key":"480_CR24","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2015.08.028","volume":"202","author":"J Przyby\u0142o","year":"2016","unstructured":"Przyby\u0142o J (2016) Neighbour distinguishing total colourings via the combinatorial nullstellensatz. Discrete Appl Math 202:163\u2013173","journal-title":"Discrete Appl Math"},{"key":"480_CR25","first-page":"898","volume":"1","author":"B Qiu","year":"2017","unstructured":"Qiu B, Wang J, Liu Y, Xu Z (2017) Neighbor sum distinguishing total colorings of graphs with bounded maximum degree and maximum average degree. CSE\/EUC 1:898\u2013901","journal-title":"CSE\/EUC"},{"key":"480_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","volume":"23","author":"V Vizing","year":"1968","unstructured":"Vizing V (1968) Some unsolved problems in graph theory. Russ Math Surv 23:125\u2013141","journal-title":"Russ Math Surv"},{"key":"480_CR27","first-page":"456","volume":"314","author":"D Yang","year":"2017","unstructured":"Yang D, Sun L, Yu X, Wu J, Zhou S (2017) Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Appl Math Comput 314:456\u2013468","journal-title":"Appl Math Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00480-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:49:04Z","timestamp":1605746944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00480-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["480"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00480-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,20]]},"assertion":[{"value":"20 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}