{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T11:02:06Z","timestamp":1774263726985,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:00:00Z","timestamp":1497312000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CNRS-PICS Project","award":["6367 \u201cGraphPar\u201d"],"award-info":[{"award-number":["6367 \u201cGraphPar\u201d"]}]},{"name":"the National Science Centre, Poland","award":["2014\/13\/B\/ST1\/01855"],"award-info":[{"award-number":["2014\/13\/B\/ST1\/01855"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00373-017-1822-3","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T04:52:59Z","timestamp":1497329579000},"page":"1459-1471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree"],"prefix":"10.1007","volume":"33","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":[[2017,6,13]]},"reference":[{"issue":"1","key":"1822_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00493-007-0041-6","volume":"27","author":"L Addario-Berry","year":"2007","unstructured":"Addario-Berry, L., Dalal, K., McDiarmid, C., Reed, B.A., Thomason, A.: Vertex-colouring edge-weightings. Combinatorica 27(1), 1\u201312 (2007)","journal-title":"Combinatorica"},{"issue":"7","key":"1822_CR2","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1016\/j.dam.2007.05.059","volume":"156","author":"L Addario-Berry","year":"2008","unstructured":"Addario-Berry, L., Dalal, K., Reed, B.A.: Degree constrained subgraphs. Discr. Appl. Math. 156(7), 1168\u20131174 (2008)","journal-title":"Discr. Appl. Math."},{"key":"1822_CR3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discr. Math. 3, 439\u2013449 (1990)","journal-title":"SIAM J. Discr. Math."},{"key":"1822_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N.: Combinatorial nullstellensatz. Comb. Probab. Comput. 8, 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"1822_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"PN Balister","year":"2007","unstructured":"Balister, P.N., Gy\u0151ri, E., Lehel, J., Schelp, R.H.: Adjacent vertex distinguishing edge-colorings. SIAM J. Discr. Math. 21(1), 237\u2013250 (2007)","journal-title":"SIAM J. Discr. Math."},{"key":"1822_CR6","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N., Hocquard, H.: Adjacent vertex-distinguishing edge coloring of graphs. In: Proceedings of the 7th European Conference on Combinatorics, Graph Theory and Applications, pp. 313\u2013318 (2013)","DOI":"10.1007\/978-88-7642-475-5_50"},{"issue":"3","key":"1822_CR7","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/jgt.22098","volume":"85","author":"M Bonamy","year":"2017","unstructured":"Bonamy, M., Przyby\u0142o, J.: On the neighbor sum distinguishing index of planar graphs. J. Graph Theory 85(3), 669\u2013690 (2017)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1822_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2686701","volume":"19","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Erd\u0151s, P., Oellermann, O.R.: How to define an irregular graph. Coll. Math. J. 19(1), 36\u201342 (1988)","journal-title":"Coll. Math. J."},{"key":"1822_CR9","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Jacobson, M.S., Lehel, J., Oellermann, O.R., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 197\u2013210 (1988)","journal-title":"Congr. Numer."},{"key":"1822_CR10","unstructured":"Cohen, N.: Several graph problems and their linear program formulations (2010) \n                        https:\/\/hal.archives-ouvertes.fr\/inria-00504914\/document\n                        \n                    . Accessed 20 Aug 2015"},{"issue":"4","key":"1822_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.20313","volume":"58","author":"B Cuckler","year":"2008","unstructured":"Cuckler, B., Lazebnik, F.: Irregularity strength of dense graphs. J. Graph Theory 58(4), 299\u2013313 (2008)","journal-title":"J. Graph Theory"},{"key":"1822_CR12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.dam.2013.10.009","volume":"166","author":"A Dong","year":"2014","unstructured":"Dong, A., Wang, G., Zhang, J.: Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree. Discr. Appl. Math. 166, 84\u201390 (2014)","journal-title":"Discr. Appl. Math."},{"issue":"5","key":"1822_CR13","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1007\/s00373-012-1191-x","volume":"29","author":"E Flandrin","year":"2013","unstructured":"Flandrin, E., Marczyk, A., Przyby\u0142o, J., Sacl\u00e9, J.-F., Wo\u017aniak, M.: Neighbor sum distinguishing index. Graphs Comb. 29(5), 1329\u20131336 (2013)","journal-title":"Graphs Comb."},{"issue":"2","key":"1822_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1002\/jgt.10056","volume":"41","author":"A Frieze","year":"2002","unstructured":"Frieze, A., Gould, R.J., Karo\u0144ski, M., Pfender, F.: On graph irregularity strength. J. Graph Theory 41(2), 120\u2013137 (2002)","journal-title":"J. Graph Theory"},{"key":"1822_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s40840-015-0207-0","volume":"39","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Wang, G., Wu, J.: Neighbor sum distinguishing edge colorings of graphs with small maximum average degree. Bull. Malays. Math. Sci. Soc. 39, 247\u2013256 (2016)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"1822_CR16","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H Hatami","year":"2005","unstructured":"Hatami, H.: \n                        $$\\Delta +300$$\n                        \n                            \n                                            \n                                \n                                    \u0394\n                                    +\n                                    300\n                                \n                            \n                        \n                     is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory Ser. B 95, 246\u2013256 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1822_CR17","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s10878-011-9444-9","volume":"26","author":"H Hocquard","year":"2013","unstructured":"Hocquard, H., Montassier, M.: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \n                        $$\\Delta $$\n                        \n                            \n                                            \n                                \u0394\n                            \n                        \n                    . J. Comb. Optim. 26(1), 152\u2013160 (2013)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"1822_CR18","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1002\/jgt.21764","volume":"76","author":"M Hor\u0148\u00e1k","year":"2014","unstructured":"Hor\u0148\u00e1k, M., Huang, D., Wang, W.: On neighbor-distinguishing index of planar graphs. J. Graph Theory 76(4), 262\u2013278 (2014)","journal-title":"J. Graph Theory"},{"key":"1822_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.dam.2015.04.018","volume":"193","author":"X Hu","year":"2015","unstructured":"Hu, X., Chen, Y., Luo, R., Miao, Z.: Neighbor sum distinguishing edge colorings of sparse graphs. Discr. Appl. Math. 193, 119\u2013125 (2015)","journal-title":"Discr. Appl. Math."},{"key":"1822_CR20","first-page":"45","volume":"5","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Choosability versus chromaticity. Geombinatorics 5, 45\u201364 (1995)","journal-title":"Geombinatorics"},{"issue":"3","key":"1822_CR21","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: A new upper bound for the irregularity strength of graphs. SIAM J. Discr. Math. 25(3), 1319\u20131321 (2011)","journal-title":"SIAM J. Discr. Math."},{"key":"1822_CR22","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.: Vertex-coloring edge-weightings: towards the 1\u20132\u20133 conjecture. J. Comb. Theory Ser. B 100, 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1822_CR23","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.: Edge weights and vertex colours. J. Comb. Theory Ser. B 91, 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1822_CR24","series-title":"Graph Theory, Combinatorics and Applications","volume-title":"Facts and Quests on Degree Irregular Assignments","author":"J Lehel","year":"1991","unstructured":"Lehel, J.: Facts and Quests on Degree Irregular Assignments. Graph Theory, Combinatorics and Applications. Willey, New York (1991)"},{"issue":"1","key":"1822_CR25","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/120886650","volume":"28","author":"P Majerski","year":"2014","unstructured":"Majerski, P., Przyby\u0142o, J.: On the irregularity strength of dense graphs. SIAM J. Discr. Math. 28(1), 197\u2013205 (2014)","journal-title":"SIAM J. Discr. Math."},{"key":"1822_CR26","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T Nierhoff","year":"2000","unstructured":"Nierhoff, T.: A tight bound on the irregularity strength of graphs. SIAM J. Discr. Math. 13, 313\u2013323 (2000)","journal-title":"SIAM J. Discr. Math."},{"key":"1822_CR27","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1002\/rsa.20553","volume":"47","author":"J Przyby\u0142o","year":"2015","unstructured":"Przyby\u0142o, J.: Asymptotically optimal neighbour sum distinguishing colourings of graphs. Random Struct. Algorithm 47, 776\u2013791 (2015)","journal-title":"Random Struct. Algorithm"},{"issue":"3","key":"1822_CR28","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/120880586","volume":"27","author":"J Przyby\u0142o","year":"2013","unstructured":"Przyby\u0142o, J.: Neighbor distinguishing edge colorings via the combinatorial nullstellensatz. SIAM J. Discr. Math. 27(3), 1313\u20131322 (2013)","journal-title":"SIAM J. Discr. Math."},{"issue":"4","key":"1822_CR29","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1002\/jgt.21852","volume":"80","author":"J Przyby\u0142o","year":"2015","unstructured":"Przyby\u0142o, J., Wong, T.-L.: Neighbor distinguishing edge colorings via the combinatorial nullstellensatz revisited. J. Graph Theory 80(4), 299\u2013312 (2015)","journal-title":"J. Graph Theory"},{"key":"1822_CR30","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10878-008-9178-5","volume":"19","author":"W Wang","year":"2010","unstructured":"Wang, W., Wang, Y.: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19, 471\u2013485 (2010)","journal-title":"J. Comb. Optim."},{"key":"1822_CR31","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.: An improved upper bound for the neighbor sum distinguishing index of graphs. Discr. Appl. Math. 175, 126\u2013128 (2014)","journal-title":"Discr. Appl. Math."},{"key":"1822_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11461-008-0009-8","volume":"3","author":"T Wang","year":"2008","unstructured":"Wang, T., Yu, Q.: On vertex-coloring 13-edge-weighting. Front. Math. Chin. 3, 1\u20137 (2008)","journal-title":"Front. Math. Chin."},{"key":"1822_CR33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.disc.2015.07.011","volume":"339","author":"X Yu","year":"2016","unstructured":"Yu, X., Qu, C., Wang, G., Wang, Y.: Adjacent vertex distinguishing colorings by sum of sparse graphs. Discr. Math. 339, 62\u201371 (2016)","journal-title":"Discr. Math."},{"key":"1822_CR34","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang, Z., Liu, L., Wang, J.: Adjacent strong edge coloring of graphs. Appl. Math. Lett. 15, 623\u2013626 (2002)","journal-title":"Appl. Math. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1822-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,18]],"date-time":"2017-11-18T17:09:55Z","timestamp":1511024995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1822-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1822"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1822-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,13]]}}}